Aufbau einer langen Wortkette


17

Diese Herausforderung besteht darin, die längste Kette englischer Wörter zu finden, bei der die ersten drei Zeichen des nächsten Wortes mit den letzten drei Zeichen des letzten Wortes übereinstimmen. Sie verwenden ein allgemeines Wörterbuch, das in Linux-Distributionen verfügbar ist und hier heruntergeladen werden kann:

https://www.dropbox.com/s/8tyzf94ps37tzp7/words?dl=0

welches 99171 englische Wörter hat. Wenn es sich bei Ihrem lokalen Linux /usr/share/dict/wordsum dieselbe Datei handelt (hat md5sum == cbbcded3dc3b61ad50c4e36f79c37084), können Sie diese verwenden.

Wörter dürfen in einer Antwort nur einmal verwendet werden.

BEARBEITEN: Buchstaben müssen genau übereinstimmen, einschließlich Groß- / Kleinschreibung, Apostrophe und Akzente.

Ein Beispiel für eine gültige Antwort lautet: idea deadpan panoramic micra craftsman mantra traffic fiche Was 8 Punkte bringen würde.

Die Antwort mit der längsten gültigen Wortkette gewinnt. Bei einem Gleichstand gewinnt die früheste Antwort. Ihre Antwort sollte die gefundene Wortkette und (natürlich) das Programm, das Sie dafür geschrieben haben, auflisten.


Wie können diese Daten geladen werden?
Hacketo

Sie sollten die Wortliste über den obigen Dropbox-Link herunterladen und dann mit Ihrem Programm verarbeiten, um die bestmögliche Antwort zu erhalten.
Logic Knight

Sind Akzente wichtig? Und was ist mit Wörtern, die kürzer als drei Buchstaben sind?
KSFT

Wörter, die kürzer als 3 Buchstaben sind, können die 3-Buchstaben-Übereinstimmungsregel nicht erfüllen und werden daher ausgeschlossen. Buchstaben müssen mit Akzenten und Groß- / Kleinschreibung übereinstimmen.
Logic Knight

1
Meine Analyse des Graphen ist, dass es nur eine nicht trivial stark verbundene Komponente gibt und der längste Pfad im komprimierten Graphen die Länge 6 hat. Dabei wird das Minimum für jede aus drei Buchstaben bestehende Folge von Wörtern im SCC mit der Folge a berücksichtigt Mit einem Präfix und einem Suffix erhalte ich eine Obergrenze von 4655 für die längste Wortkette, sodass es möglicherweise noch viel Raum gibt, um die aktuelle Bestleistung von 1733 zu verbessern.
Peter Taylor

Antworten:


9

Java, Heuristik, die den Scheitelpunkt bevorzugt, der den größten Graphen hervorruft: 1825 1855 1873

Der folgende Code wird in weniger als 10 Minuten ausgeführt und findet den folgenden Pfad:

[wad, wadis, dis, dismay, may, mayfly, flywheels, elsewhere, erecting, ingratiate, ateliers, ersatzes, zest, esthetic, tickled, ledger, germicide, idealizes, zestful, fulling, ingrains, institute, uterine, ineptness, essaying, ingeniously, slyness, essences, cessations, onshore, ores, resoundingly, glycerine, inertness, essay, say, saying, ingenuous, ousted, tediously, sly, slyest, estrogen, genuflecting, ingestion, ionizer, zeros, roses, sesames, mes, meshed, hedonist, isthmuses, sesame, amending, ingredient, entrapment, enthuses, session, ionosphere, erectness, essayist, isthmus, mustaches, hesitatingly, glycogen, generation, ions, onset, settable, blew, lewder, deriding, ingratiates, testicles, lessen, sensitization, ionization, ionizing, ingratiating, ingenious, ouster, terrorizing, ingest, estranges, gesticulating, ingrates, testis, tissue, sue, suede, edelweiss, issuing, ingraining, ingrown, owner, nerdiest, estimation, ionospheres, rescue, cue, cueing, ingesting, ingot, got, gotten, tensor, sorrowing, ingratiated, tedious, ousting, ingratiatingly, glycerin, ringside, identifiable, bleariest, ester, terminological, calibrator, torrent, entraps, apse, pseudonym, nymphomania, niacin, cinema, emailed, led, ledges, gesticulates, testicle, clement, entail, ail, ailment, enter, terrains, inspires, restaurateur, euros, rosiest, estimates, tester, termite, iterator, torture, urethras, raspiest, estimator, tore, oregano, anointment, enthuse, useful, fulfil, filmstrip, riposte, stereotyped, pedicure, urea, readmits, itself, elf, elfin, finagles, lesbians, answerable, bleat, eatery, erythrocytes, testosterone, one, ones, nest, esteemed, medicine, inextricable, blessed, sediment, entry, try, tryout, outsources, cesarians, answered, redressed, seducer, cervical, calumniates, test, establishment, entombment, enthusiastic, tickles, lessens, ensemble, blemishes, hesitant, antic, tick, ickiest, estimable, blemished, hedgehog, hogan, gantlet, letdown, own, ownership, hippest, estates, testates, testiest, establishes, hes, hesitates, testable, bleakest, esthetes, testament, entice, iceberg, erg, ergonomic, microscope, operatives, vestibules, lesser, serenade, adenoidal, dales, lest, estrangement, entrap, raptures, resourceful, fulsome, omen, menswear, earthliest, established, hedges, gestates, testy, styes, yeshivot, voter, terrible, blender, derides, descent, enticed, cedillas, lass, assailable, bleacher, hermit, mite, item, temperas, rash, ashtray, rayon, yonder, dermis, mismanage, agendas, dash, ashy, shy, shyster, terrapins, insatiable, bleeder, derives, vestment, entangle, glen, lengthens, ensconced, ceded, deduced, cedars, arsenic, nice, ice, iced, cedar, daredevil, villa, llamas, masseuse, use, useable, bleach, achievable, bleached, hedonistic, tic, ticker, kerchieves, vessel, sell, ell, elliptic, ticket, kettles, lessee, seeps, epsilon, longboat, oath, atherosclerosis, sisterhood, oodles, lesson, sonatas, tassel, selvage, age, agent, entranced, cedes, descender, deranges, gestures, restraint, interment, enthused, seduced, cedilla, llama, amalgam, gamut, mutable, blend, endear, earthy, thymus, mussel, seltzer, zero, erodes, despot, potful, fulfillment, enthrall, allot, lotus, tussle, sledgehammered, redolent, entrapped, pedestal, talk, alkalis, listen, tended, deductible, bleeped, pedigree, reentered, redistribute, uterus, rustproofed, fed, fedora, oranges, gesundheit, either, herdsman, manes, nestles, lessor, sorrowful, fullback, acknowledges, gestured, redoubtable, blended, deduces, cesareans, answer, werewolves, vesper, perseveres, restructures, reside, ideogram, rammed, meddlesome, omens, ensign, ignores, restrains, insolent, entanglement, entrenchment, enticement, entomological, calligraphy, physical, calico, iconoclast, astringent, entertainment, entrant, antennas, nasty, stymie, miens, enslave, averred, redefine, inexorable, blenched, hedgerow, rowboat, oat, oaten, tend, endears, arson, songwriter, terminable, blent, entreaty, atypical, calypso, psoriasis, sister, term, ermine, ineligible, bleaker, kerosene, enema, emancipator, tormentor, torrider, derailment, entertains, instil, tildes, destine, inelegant, anthropomorphic, hiccup, cupolas, lastingly, glycerol, rollback, acknowledgment, entombed, bedridden, denser, servicewomen, menopause, used, sedatives, vesicle, clearinghouse, user, servant, antipodes, descry, crystalline, inexpedient, enthusiast, astonishment, entirety, etymological, calendared, redbreast, astronomer, merinos, nosedove, overpay, pay, paymaster, termagant, antiaircraft, aftercare, ares, resentful, fulcrum, rumpus, pushcart, artiste, stethoscopes, pesetas, taste, steadfast, astride, ides, destitute, utensil, silvan, vanguard, ardent, entryway, waysides, despair, airdrop, ropes, pestered, redder, derangement, entered, redeemed, medullas, lasagnas, nasal, salsas, sashay, hay, haymow, mow, mowed, wedder, derringer, germane, anemic, microfilmed, media, diatom, tomboys, oyster, terminator, toreador, dorsal, salespeople, pleased, sedater, terabit, bitten, tentacle, clergyman, manifesto, stomach, achoo, hoopla, plaza, azalea, leaven, vendor, dormant, antiparticle, cleared, redraft, afterword, ordains, insufficient, entitlement, entomb, ombudsmen, men, mental, tallyhos, hospice, icecap, cape, aperitif, tiffed, fedoras, rasped, pediatric, rickshaw, hawker, keratin, tinctures, reset, setback, acknowledgement, enthronement, entwine, inexact, actor, torpedos, dosed, sedan, dancer, cerebrum, rumple, plea, leach, ache, cheaper, per, periscopes, pestilent, entreat, eater, terser, serape, ape, apes, pesky, skycap, capped, pederast, astuter, terrace, acetaminophen, henchmen, menopausal, saltcellar, lard, ardor, dormice, icebound, underbrush, ushered, redrew, rewound, underclass, assassin, sinew, newscast, astrologer, gerund, undertaken, ken, kens, ensnared, redcap, cappuccinos, nostrum, rum, rumored, redraw, rawhide, identical, calcine, inertia, tiara, arabesque, queerer, reruns, unsold, oldie, diesel, selectmen, mentored, redden, dental, talon, longhand, and, androgen, genome, omelet, lethal, hallucinogenic, nickname, amen, menhaden, denudes, despaired, redevelop, lope, operas, rasp, aspired, redskin, kindergartens, ensnares, resultant, anthropological, callus, lustful, fulcra, crammed, mediocre, crepes, pesticide, ideas, eastbound, under, derrières, respired, rediscovered, redundant, antihero, erode, ode, odes, described, bedevil, villager, gerrymander, deride, ideograph, aphid, hid, hides, describes, besides, despoil, oilskin, kingdom, dominant, ant, antipasti, stiffens, ensured, redeemer, merchant, antiwar, warped, pederasty, stylus, lush, usher, her, hereafter, terrapin, pinnacle, clerical, caliber, bereave, avenger, geriatric, rickshas, haste, stereoscopes, pester, termini, initiator, tortures, restorer, reran, ransomed, medulla, llanos, nostril, rill, illogical, calif, lifer, fervor, vortex, textures, resister, termed, medieval, valor, lord, ordered, rediscover, verbatim, times, mesdames, mescal, caliper, periscope, opera, erasures, restart, artichokes, kestrel, reliant, antebellum, lumbago, agog, goggle, gleeful, fulfill, illustrator, tor, torque, questionnaires, resumed, mediator, tort, orthodoxy, oxymora, oratorio, riot, iotas, taster, terrific, fiche, checkpoint, interloper, perfumes, mesas, sassafras, rasher, heraldry, drywall, all, allergens, ensnare, area, rearm, armchair, airman, manufactures, resurface, acerbic, bicycle, cleverer, rerun, runt, untidy, idyllic, lichens, ensures, resend, endemic, microchip, hippopotamus, muscatel, telecast, astronaut, autopilot, lot, loth, other, heros, rosin, single, gleamed, mediaeval, valet, lettered, redound, underside, ideological, calliper, perihelia, liaison, sonic, nicknames, messenger, germicides, descendant, antigen, genital, tall, allergen, gentleman, mangos, gossipped, pedicures, resistant, antlered, redeveloped, pedagogical, calligrapher, heroins, inside, idea, deafen, fen, fencer, cerebra, bravuras, rascal, calculus, lusher, herbivores, resins, instill, illicit, citric, ricochet, heterodoxy, oxygen, generic, rice, icebox, box, boxcar, cartography, physique, quell, ellipsis, sis, sisal, sallow, lowbrow, rowel, well, elliptical, calf, alfresco, scow, cow, cowboy, boy, boyfriend, end, endeared, red, redesign, ignoramus, musket, kettledrum, rump, umped, pedlar, larvas, vassal, salmonellas, last, astronomical, calfskin, kingfisher, hereupon, ponchos, hospital, talisman, mantel, telethon, honcho, chomped, pedant, antitoxins, instant, antipastos, tossup, superintend, endangered, redskins, instigator, torpor, portico, icon, conquistador, dormer, merganser, seraphic, hiccuped, pedagogue, guerrillas, laser, sera, eraser, seraph, aphasic, sickbed, bed, bedsores, resign, ignorant, anthropocentric, richer, herdsmen, menu, enures, resuscitator, tornado, ado, adobe, obeisant, anthill, illegal, gallon, longshoremen, menace, ace, acetylene, enemas, mas, mascot, cot, cotton, tonsures, restores, result, ultraviolet, letterbox, boxer, xerography, physiological, calmer, merchantmen, mentor, torus, russet, settee, teenager, gerbil, billfold, old, olden, denatures, resubmit, mitten, ten, tenon, nonchalant, antique, queasy, asymmetric, ricksha, shanghai, haircut, cutups, upsides, descriptor, torpid, pidgin, gins, instep, tepee, peeper, perturb, urbane, anemia, miasmas, mascaras, raspy, spy, spyglass, assures, resonator, tortilla, llano, anon, nontechnical, calabash, ashram, rampart, arthropod, podia, diagram, ramp, amp, amphitheatres, resistor, tortillas, lasagna, gnat, natal, talc, alcoholic, licensee, seemed, medical, calm, almanac, nacho, choreography, phylum, lumbar, barman, mannequins, insures, respires, resound, underarm, armatures, resides, desideratum, tumult, ultrasound, underdog, dogcatcher, herald, alderwoman, mandarins, insecticides, desires, respirator, torrid, rid, rides, descant, anticlimax, maximum, mum, mummer, meringue, guesser, sermon, monogram, ramrod, rodeo, deodorant, antelopes, peso, esophagus, gusset, setups, upshot, hotel, telescope, open, penicillin, lingos, gossip, sip, siphon, honor, normal, maltreat, eaten, tenet, nether, herpes, pesticides, descend, endow, downfall, alleyway, way, waylay, layman, manicures, reshuffle, flea, lea, leash, ashen, henchman, mandolin, linchpins, inscribes, bestow, townspeople, plectrum, rumbas, baste, sternum, numb, umbilici, icicle, cleaver, vertebra, brains, insouciant, antidepressant, anthem, hemoglobin, binocular, largos, gossamer, mermaid, aid, aides, desperado, adopt, opt, optima, imam, mambos, bosun, sun, sunspot, potpourris, risky, sky, skyscraper, perturbed, bedraggle, glee, lee, leech, echo, choreographer, heraldic, dictum, tumid, midday, day, daybed, bedsides, desktop, topknot, notepaper, periodical, calendar, dare, areas, easel, selfsame, amebas, basins, ins, insulin, linnet, nettlesome, omegas, gasp, aspartame, amend, endures, researcher, herbal, balsas, sass, assault, ultimatum, tumor, mortgagor, gores, resort, orthopaedic, dictatorship, hipper, person, sonar, narc, arc, archduke, ukelele, elegant, anther, hereabout, outfox, fox, foxtrot, rotogravures, restaurant, antechamber, beret, retriever, verbena, enamor, morsel, sellout, outmaneuver, vertical, call, allergenic, niche, chessman, mandolins, insipid, pidgins, install, allures, rescind, indignant, antithetical, calicos, cosmonaut, auto, utopia, piano, another, heretical, calk, alkali, alibi, ibis, bistro, troupe, upend, endorser, serviceman, mandarin, rind, inductee, teepee, pee, peekaboo, bootstrap, rape, apertures, resin, singular, larval, valiant, antiperspirant, antipasto, stop, topical, calisthenic, nicer, cervix, vixen, xenophobic, bicep, cephalic, licit, citizenship, hippopotami, amigos, gospel, pellet, letups, upstart, artificer, cerebellum, lumberman, manic, nicknamed, medic, dickie, kielbasas, sash, ash, ashcan, cannon, nonskid, kid, kidnaper, perjures, resolver, vernacular, larkspur, puree, reefer, ferret, retains, insofar, far, fart, artisan, sandbag, bagel, gelatin, tinsel, selectman, manacle, clever, versus, sustains, inscribed, bedpan, pandemic, microprocessor, sorbet, bet, betcha, char, harem, remodel, deli, elicit, citadel, deliver, verandas, dashikis, kisser, servicemen, menthol, holiday, daydreamer, merchantman, manikins, insane, anew, newsprint, interwove, overreach, achieve, even, venom, nomad, mad, madrigal, gala, alarm, armpit, pitchman, manor, northbound, underbid, bidet, detox, toxemia, miasma, smarten, tenderloins, insult, ultra, travel, velvet, veteran, random, domino, inopportune, uneconomic, microbes, bestir, tiro, ironware, arena, enamel, melodramas, mastodon, don, donut, nut, nutmeg, meg, megalopolis, lissom, sombre, breathe, therefrom, romper, performer, merman, mangrove, overshadow, downcast, astir, tiros, rostra, trachea, heaven, ventricle, clergywoman, maneuver, verbal, ballad, ladyship, hippie, pie, piebald, alderman, manatee, teethe, thereupon, poncho, choicer, ceramic, microscopic, picayune, uneaten, tendon, donor, northeast, astound, underpass, assessor, sorghum, hum, human, mantra, trainee, needlepoint, interplay, laywoman, mannikin, kinsman, mantillas, lassie, sieve, ever, verdigris, risen, sensor, sorrel, relabel, belabor, borsch, schlep, leprechauns, unsnap, nap, napkin, kin, kingpin, pinkeye, eyeglass, assemblyman, manikin, kingship, hip, hippos, postpartum, tumbrel, relic, lichee, heehaw, haw, hawser, servicewoman, many, anyhow, howsoever, vertex, text, extra, trap, rap, rapper, periwig, wigwag, wag, wagon, gonorrhea, heave, aver, vermin, minesweeper, perplex, lexicon, congas, gastronomic, microfiche, cheapen, pentathlon, longhair, air, aircraft, aft, aftertaste, stem, tempos, postwar, war, wart, article, clear, earshot, hotshot, hotbed, bedlam, lam, lambkin, kindergarten, tenser, serum, rumor, mortar, tarmac, macabre, breech, echos, hostel, telescopic, pickerel, relay, laypeople, pleas, east, astronomic, micra, crackpot, pot, potato, atom, tombed, bedbug, bugaboo, bootleg, leg, legato, atop, topple, plethora, orangutang, angora, orangutan, tan, tandem, democrat, rat, rattan, tang, angry, gryphon, honeybee, bee, beeswax, waxen, xenon, nonplus, lustre, trellis, lisle, sleepwear, earwig, wig, wigwam, wampum, pummel, melanomas, massacre, cretin, tin, tint, interviewee, wee, weeper, persimmon, monsignori, origin, gingham, ham, hamper, pericardia, diarrhea, heartthrob, rob, robes, besom, sombreros, rosebud, bud, budgerigar, garret, retrodden, denim, nimbus, bus, bushel, helmet, metaphor, horsefly, flypaper, peritonea, near, ear, earlobes, bestowal, wall, allay, layout, outlast, astrakhan, handicapper, perusal, saltpetre, tremor, moribund, undercut, cut, cutoff, off, offal, falcon, con, consul, sultan, tannin, ninepin, pinball, allegro, grommet, metro, trot, rot, rotten, tenpin, pineapple, plectra, transit, sitar, tar, taro, arousal, salmon, moneybag, bagpipe, ipecac, cache, checkout, outrun, runaround, undersea, sea, sear, earache, cherub, rub, rubicund, underpin, pin, pint, intagli, glib, lib, libel, bellyache, cherubim, bimbos, bosuns, unsound, undertow, tow, towel, wellington, ton, tonsil, silicon, concoct, octet, tetrahedra, drachmae, maestri, tripos, possum, sum, sumac, macro, crocus, custom, tom, tomcat, catsup, sup, superstar, tarpaulin, linchpin, pinpoint, intercom, comet, met, metacarpus, pussycat, catastrophe, phenomenon, nonverbal, ballpoint, interurban, bani, animal, malt, altar, tartar, tarot, rotund, undergrad, radio, diocesan, sandbar, bar, barren, renewal, walkout, outstrip, ripen, pen, pencil, cilantro, trout, outran, rancor, corncob, cob, cobra, bra, brag, rag, ragas, gas, gasohol, holdout, output, put, putsch, schwas, was, waste, stereo, reoccur, cur, curb, urban, ban, bantam, tam, tamp, ampul, pullout, outwit, wit, withal, halo, alohas, hasp, asparagus, gusto, stove, overlap, lapel, pelvis, visit, sit, sitcom, compendia, diadem, demigod, god, goddam, dam, dampen, pennon, non, noncom, compel, pelican, cancan, can, cancel, celesta, starlit, lit, litmus, muscat, cat, catnap, naphtha, than, handcar, carpel, pellagra, grammar, mar, mariachi, chichi, chi, chimp, imp, impel, pelvic, vicar, car, caribou, bourgeoisie, siesta, stab, tab, tabu, abut, but, butterfat, fat, fathom, homespun, pun, puns, unsheathe, the, theorem, remove, overtax, tax, taxicab, cab, cabal, balsam, sambas, basal, salamis, missal, salt, altho, tho, thou, housebound, underground, underclassman, man, mannikins, insectivores, resonant, antelope, operator, torn, ornamental, tallow, low, lowered, reddens, enshrine, inefficient, entertainer, nerves, vestiges, gesturing, ingested, tediousness, essentials]

Kernideen

In Approximation der am längsten gerichteten Wege und Zyklen , Bjorklund, Husfeldt und Khanna, Lecture Notes in Computer Science (2004), 222-233, schlagen die Autoren vor, dass in spärlichen Expandergraphen ein langer Weg durch eine gierige Suche gefunden werden kann, die bei jedem auswählt Schritt den Nachbarn des aktuellen Endes des Pfads, der den größten Teilgraphen in G 'überspannt, wobei G' der ursprüngliche Graph ist, bei dem die Eckpunkte im aktuellen Pfad gelöscht sind. Ich bin mir nicht sicher, ob es sich bei einem Graphen um einen Expander-Graphen handelt, aber wir haben es sicherlich mit einem spärlichen Graphen zu tun, und da sein Kern etwa 20000 Scheitelpunkte hat und er nur einen Durchmesser von 15 hat, muss er gut sein Expansionseigenschaften. Also nehme ich diese gierige Heuristik an.

Anhand eines Graphen G(V, E)können wir herausfinden, wie viele Eckpunkte von jedem Eckpunkt aus mit Floyd-Warshall in der Theta(V^3)Zeit oder mit Johnsons Algorithmus in der Theta(V^2 lg V + VE)Zeit erreichbar sind. Ich weiß jedoch, dass es sich um einen Graphen handelt, der eine sehr große, stark verknüpfte Komponente (SCC) hat, daher gehe ich anders vor. Wenn wir SCCs mit Tarjans Algorithmus identifizieren, erhalten wir auch eine topologische Sortierung für den komprimierten Graphen G_c(V_c, E_c), der mit der Zeit viel kleiner sein wird O(E). Da G_cein DAG ist, können wir die Erreichbarkeit in berechnen G_cin der O(V_c^2 + E_c)Zeit. (Ich habe später festgestellt, dass dies in Übung 26-2.8 der CLR angedeutet ist ).

Da der dominierende Faktor in der Laufzeit ist E, optimiere ich ihn, indem ich Dummy-Knoten für die Präfixe / Suffixe einfüge. Anstatt also 151 * 64 = 9664 Ränder von Worten endet -res auf Wörter res- Ich habe 151 Kanten von Worten endet -res bis # res # und 64 Kanten aus # res # auf Wörter res- .

Und da jede Suche auf meinem alten PC ungefähr 4 Minuten dauert, versuche ich, die Ergebnisse mit früheren langen Pfaden zu kombinieren. Das geht viel schneller und ist meine derzeit beste Lösung.

Code

org/cheddarmonk/math/graph/Graph.java:

package org.cheddarmonk.math.graph;

import java.util.Set;

public interface Graph<V> {
    public Set<V> getAdjacent(V node);
    public double getWeight(V from, V to);
}

org/cheddarmonk/math/graph/MutableGraph.java:

package org.cheddarmonk.math.graph;

import java.util.*;

public class MutableGraph<V> implements Graph<V> {
    private Map<V, Map<V, Double>> edgesBySource = new HashMap<V, Map<V, Double>>();

    public void addEdge(V from, V to, double weight) {
        if (!edgesBySource.containsKey(to)) edgesBySource.put(to, new HashMap<V, Double>());
        Map<V, Double> e = edgesBySource.get(from);
        if (e == null) edgesBySource.put(from, e = new HashMap<V, Double>());
        if (e.containsKey(to)) throw new IllegalArgumentException("There is already an edge between the vertices");
        e.put(to, weight);
    }

    @Override
    public Set<V> getAdjacent(V node) {
        Map<V, Double> e = edgesBySource.get(node);
        if (e == null) throw new IllegalArgumentException("node doesn't appear to be in the graph");
        return Collections.unmodifiableSet(e.keySet());
    }

    @Override
    public double getWeight(V from, V to) {
        Map<V, Double> e = edgesBySource.get(from);
        if (e == null) throw new IllegalArgumentException("from doesn't appear to be in the graph");
        if (!edgesBySource.containsKey(to)) throw new IllegalArgumentException("to doesn't appear to be in the graph");

        Double c = e.get(to);
        return c == null ? 0 : c.doubleValue();
    }
}

org/cheddarmonk/math/graph/StronglyConnectedComponents.java:

package org.cheddarmonk.math.graph;

import java.util.*;

/**
* A helper class for finding the strongly connected components of a graph using Tarjan's algorithm.
* http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
*/
public class StronglyConnectedComponents<V> {
    private final Graph<V> g;
    private List<Set<V>> topologicallySortedSccs = new ArrayList<Set<V>>();

    private final LinkedList<V> S = new LinkedList<V>();
    private final Set<V> S2 = new HashSet<V>();
    private final Map<V, Integer> index = new HashMap<V, Integer>();
    private final Map<V, Integer> lowlink = new HashMap<V, Integer>();

    private StronglyConnectedComponents(Graph<V> g) {
        this.g = g;
    }

    private void strongConnect(V v) {
        int idx = index.size();
        index.put(v, idx);
        lowlink.put(v, idx);

        S.push(v);
        S2.add(v);

        for (V w : g.getAdjacent(v)) {
            if (!index.containsKey(w)) {
                strongConnect(w);
                if (lowlink.get(w) < lowlink.get(v)) {
                    lowlink.put(v, lowlink.get(w));
                }
            }
            else if (S2.contains(w)) {
                if (index.get(w) < lowlink.get(v)) {
                    lowlink.put(v, index.get(w));
                }
            }
        }

        if (lowlink.get(v).equals(index.get(v))) {
            Set<V> scc = new HashSet<V>();
            V w;
            do {
                w = S.pop();
                S2.remove(w);
                scc.add(w);
            } while (!w.equals(v));

            topologicallySortedSccs.add(scc);
        }
    }

    public static <V> List<Set<V>> analyse(Graph<V> g, Set<V> sources) {
        if (g == null) throw new IllegalArgumentException("g");

        StronglyConnectedComponents<V> scc = new StronglyConnectedComponents<V>(g);
        for (V v : sources) {
            if (!scc.index.containsKey(v)) {
                scc.strongConnect(v);
            }
        }

        return scc.topologicallySortedSccs;
    }
}

org/cheddarmonk/ppcg/PPCG.java:

package org.cheddarmonk.ppcg;

import java.io.*;
import java.util.*;
import org.cheddarmonk.math.graph.*;

public class PPCG44922 {
    private static final String path = "/usr/share/dict/words";
    private static Set<String> allWords;
    private static Graph<String> fullGraph;

    public static void main(String[] args) {
        loadGraph();

        Random rnd = new Random();
        rnd.setSeed(8104951619088972997L);
        List<String> a = search(rnd);
        rnd.setSeed(-265860022884114241L);
        List<String> b = search(rnd);
        List<String> chain = spliceChains(a, b);
        System.out.println(chain.size());
        System.out.println(chain);
    }

    private static List<String> search(Random rnd) {
        List<String> chain = new ArrayList<String>();
        chain.add(selectOptimalReachabilityCount(fullGraph, allWords, rnd));
        while (true) {
            String tail = chain.get(chain.size() - 1);
            FilteredGraph g = new FilteredGraph(chain);

            // We know that tail only has one successor, so skip ahead.
            Set<String> candidates = new HashSet<String>(fullGraph.getAdjacent(suffix(tail)));
            candidates.removeAll(chain);
            if (candidates.isEmpty()) break;

            chain.add(selectOptimalReachabilityCount(g, candidates, rnd));
        }

        Iterator<String> it = chain.iterator();
        while (it.hasNext()) {
            if (it.next().charAt(0) == '#') it.remove();
        }
        return chain;
    }

    private static List<String> spliceChains(List<String> a, List<String> b) {
        Set<String> intersect = new HashSet<String>(b);
        intersect.retainAll(a);
        if (intersect.isEmpty()) return null;

        // Splice the longest bits. To avoid cycles, we look for intersection points which have the same set of reached intersection points.
        // Thus to get from one to the next we can take either route without violating the unique occurrence of each element in the spliced chain.
        Set<String> left = new HashSet<String>();
        Set<String> right = new HashSet<String>();
        List<String> newChain = new ArrayList<String>();

        // NB We assume that either a(0) and b(0) are the same or neither is in intersect.
        // This is a safe assumption in practice because they're both "wad".
        int idxA = 0, idxB = 0, nextA = 0, nextB = 0;
        while (idxA < a.size()) {
            nextA++;
            while (nextA < a.size() && !intersect.contains(a.get(nextA))) nextA++;
            String tailA = nextA < a.size() ? a.get(nextA) : "";
            left.add(tailA);

            nextB++;
            while (nextB < b.size() && !intersect.contains(b.get(nextB))) nextB++;
            String tailB = nextB < b.size() ? b.get(nextB) : "";
            right.add(tailB);

            if (left.equals(right) && tailA.equals(tailB)) {
                // We take the longer of idxA to nextA-1 or idxB to nextB - 1.
                if (nextA - idxA > nextB - idxB) newChain.addAll(a.subList(idxA, nextA));
                else newChain.addAll(b.subList(idxB, nextB));

                idxA = nextA;
                idxB = nextB;
            }
        }

        if (new HashSet<String>(newChain).size() == newChain.size()) return newChain;
        throw new IllegalStateException();
    }

    private static void loadGraph() {
        Set<String> words = new HashSet<String>();
        Set<String> prefixes = new HashSet<String>();
        Set<String> suffixes = new HashSet<String>();
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(path), "UTF-8"));
            String line;
            while ((line = br.readLine()) != null) {
                if (line.length() >= 3) {
                    words.add(line);
                    prefixes.add(prefix(line));
                    suffixes.add(suffix(line));
                }
            }
            br.close();
        }
        catch (IOException ioe) {
            throw new RuntimeException(ioe);
        }

        // Filter down to a core with decent reachability.
        prefixes.retainAll(suffixes);
        MutableGraph<String> g = new MutableGraph<String>();
        Iterator<String> it = words.iterator();
        while (it.hasNext()) {
            String line = it.next();
            if (prefixes.contains(prefix(line)) && prefixes.contains(suffix(line))) {
                // In the interests of keeping the number of edges down, I insert fake vertices.
                g.addEdge(prefix(line), line, 1);
                g.addEdge(line, suffix(line), 1);
            }
            else it.remove();
        }

        fullGraph = g;
        allWords = Collections.unmodifiableSet(words);
    }

    private static String prefix(String word) {
        return "#" + word.substring(0, 3) + "#";
    }

    private static String suffix(String word) {
        return "#" + word.substring(word.length() - 3, word.length()) + "#";
    }

    private static <V> Map<V, Integer> reachabilityCount(Graph<V> g, Set<V> sources) {
        List<Set<V>> sccs = StronglyConnectedComponents.analyse(g, sources);
        int n = sccs.size();

        // Within a strongly connected component, each vertex can reach each other vertex.
        // Then we need to also take into account the other SCCs which they can reach.
        // We can exploit the fact that we already have a topological sort of the DAG of SCCs to do this efficiently.
        Map<V, Integer> index = new HashMap<V, Integer>();
        for (int i = 0; i < n; i++) {
            for (V v : sccs.get(i)) index.put(v, i);
        }

        BitSet[] reachableSccs = new BitSet[n];
        Map<V, Integer> reachabilityCounts = new HashMap<V, Integer>();
        for (int i = 0; i < n; i++) {
            Set<V> scc = sccs.get(i);
            reachableSccs[i] = new BitSet(n);
            reachableSccs[i].set(i);
            for (V v : scc) {
                for (V w : g.getAdjacent(v)) {
                    int j = index.get(w);
                    if (j < i) reachableSccs[i].or(reachableSccs[j]);
                }
            }

            int count = 0;
            for (int j = reachableSccs[i].nextSetBit(0); j >= 0; j = reachableSccs[i].nextSetBit(j+1)) {
                count += sccs.get(j).size();
            }
            for (V v : scc) {
                reachabilityCounts.put(v, count);
            }
        }

        return reachabilityCounts;
    }

    private static <V extends Comparable<? super V>> V selectOptimalReachabilityCount(Graph<V> g, Set<V> candidates, Random rnd) {
        Map<V, Integer> r = reachabilityCount(g, candidates);

        int max = 0;
        List<V> attaining = new ArrayList<V>();
        for (V candidate : candidates) {
            int score = r.get(candidate);
            if (score > max) {
                max = score;
                attaining.clear();
            }
            if (score == max) attaining.add(candidate);
        }

        return selectRandom(attaining, rnd);
    }

    private static <T extends Comparable<? super T>> T selectRandom(Collection<T> elts, Random rnd) {
        List<T> deterministic = new ArrayList<T>(elts);
        Collections.sort(deterministic);
        Collections.shuffle(deterministic, rnd);
        return deterministic.get(0);
    }

    private static class FilteredGraph implements Graph<String> {
        private final Set<String> filteredVertices;

        public FilteredGraph(Collection<String> filteredVertices) {
            this.filteredVertices = new HashSet<String>(filteredVertices);
        }

        @Override
        public Set<String> getAdjacent(String node) {
            if (filteredVertices.contains(node)) return Collections.emptySet();

            Set<String> adj = new HashSet<String>(fullGraph.getAdjacent(node));
            adj.removeAll(filteredVertices);
            return adj;
        }

        @Override
        public double getWeight(String from, String to) {
            throw new RuntimeException("Not used");
        }
    }
}

"Aufrichten" hmm ..
Matthew Roh

6

Rubin, 1701

"Del" -> "ersatz's"( vollständige Sequenz )

Der Versuch, die optimale Lösung zu finden, erwies sich zeitlich als zu kostspielig. Warum also nicht zufällige Stichproben auswählen, was wir können und auf das Beste hoffen?

Zunächst Hashwird a erstellt, das Präfixe auf vollständige Welten abbildet, die mit diesem Präfix beginnen (z "the" => ["the", "them", "their", ...]. B. ). Dann wird für jedes Wort in der Liste die Methode sequenceaufgerufen. Es erhält die Wörter, die möglicherweise aus dem folgen könnten Hash, entnimmt ein Beispiel von 100und ruft sich selbst rekursiv auf. Das längste wird genommen und stolz angezeigt. Der Startwert für das RNG ( Random::DEFAULT) und die Länge der Sequenz werden ebenfalls angezeigt.

Ich musste das Programm einige Male ausführen, um ein gutes Ergebnis zu erzielen. Dieses besondere Ergebnis wurde mit Samen erzeugt 328678850348335483228838046308296635426328678850348335483228838046308296635426.

Skript

require "json"

def prefix(word); word[0, 3];  end
def suffix(word); word[-3, 3]; end

def sequence(word, prefixes, skip)
  if SUBS.key?(word) && (SUBS[word] - skip) == SUBS[word]
    return SUBS[word]
  end

  skip         += [word] 
  suffix        = suffix(word)
  possibilities = (prefixes[suffix] ||= []) - skip

  if possibilities.empty?
    return [word]
  else
    sequences = possibilities.sample(100).map do |possibility|
      sequence(possibility, prefixes, skip)
    end

    return SUBS[word] = [word] + sequences.max_by(&:size)
  end
end

def correct?(sequence)
  once_only = sequence.all? { |y| sequence.count(y) == 1 }
  following = sequence.each_cons(2).all? { |a,b| a[-3,3] == b[0,3] }

  return once_only && following
end

words = open("words.txt", "r", &:read).split.select { |word| word.size >= 3 }

SUBS     = {}
PREFIXES = {}

# Built a Hash that maps prefixes to an Array of words starting with the prefix.
words.each do |word|
  prefix = prefix(word)

  PREFIXES[prefix] ||= []
  PREFIXES[prefix] << word
end

longest = [1]

words.each do |word|
  PREFIXES[prefix(word)].delete(word)

  sequence = sequence(word, PREFIXES, [word])

  if sequence.size > longest.size
    longest = sequence
  end
end

puts longest.inspect
puts 
puts "Generated with seed: #{Random::DEFAULT.seed}"
puts "Length: #{longest.size}"
puts "Correct: #{correct?(longest)}"

Ich habe nicht daran gedacht, die Möglichkeiten für das nächste Wort zufällig zu untersuchen! Ich benutze diese Idee!
KSFT

Wie lange hat das gedauert?
KSFT

Ich habe es nicht zeitlich festgelegt, aber ich schätze ungefähr 15-20 Minuten (ich lasse es über das Abendessen laufen).
britishtea

Meine Python-
Version erstellt

Das Wörterbuch sollte schnell erstellt werden (eine einzige Iteration durch alle Wörter). Ruby meldet 0.0996Sekunden.
britishtea

5

Partitur: 1631 1662 Wörter

['Aachen', 'hen', 'henceforward', 'ardor', 'dorsal', 'salmon', 'monolog', 'log', 'logjam', 
'jam', 'jamb', 'ambassador', 'dormouse', 'useable', 'bleeding', 'ingenious', 'ouster', 
'terminable', 'bleakness', 'essay', 'say', 'saying', 'ingress', 'essences', 'cession', 
....
....
'ionosphere', 'ere', 'erecting', 'ingratiating', 'ingrate', 'ate', 'ateliers', "ersatz's"]

Die gesamte Sequenz finden Sie hier: http://pastebin.com/TfAvhP9X

Ich habe nicht den vollständigen Quellcode. Ich habe verschiedene Ansätze ausprobiert. Aber hier sind einige Code-Schnipsel, die in der Lage sein sollten, eine Sequenz von ungefähr der gleichen Länge zu erzeugen. Entschuldigung, es ist nicht sehr schön.

Code (Python):

Zuerst eine Vorverarbeitung der Daten.

from collections import defaultdict

with open('words') as f:
    words = [line.strip() for line in f]
words = [word for word in words if len(word)>=3 and word[-2:]!="'s"]

word_connections = defaultdict(list)
for word in words:
    word_connections[word[:3]].append(word)

Dann habe ich eine rekursive Funktion definiert (Tiefensuche).

global m
m=0
def find_chain(chain):
    s = set(word_connections[chain[-1][-3:]])-set(chain)
    if len(s)== 0:
        global m
        if len(chain) > m:
            m=len(chain)
            print(len(chain), chain)
    else:
        for w in s:
            if w not in chain:
                find_chain(chain + [w])

for word in words:
    find_chain([word])

Das dauert natürlich viel zu lange. Aber nach einiger Zeit fand es eine Sequenz mit 1090 Elementen und ich hörte auf.

Das nächste, was zu tun ist, ist eine lokale Suche. Für jeweils zwei Nachbarn n1, n2 in der Sequenz versuche ich, eine Sequenz zu finden, die bei n1 beginnt und bei n2 endet. Wenn eine solche Sequenz existiert, füge ich sie ein.

def tryimpove(chain, length, startvalue=0):
    s=set(chain)
    for i in range(startvalue,len(chain)-1):
        print(i)
        for sub in sorted(short_sequences([chain[i]],length,chain[i+1]),key=len,reverse=True):

            if len(s & set(sub))==1:
                chain[i:i+1]=sub
                print(i,'improved:',len(chain))
                return tryimpove(chain,length,i)
    return chain

def short_sequences(chain,length,end):
    if 2 <= len(chain):
        if chain[-1][-3:]==end[:3]:
            yield chain
    if len(chain) < length:
        s = set(word_connections[chain[-1][-3:]])-set(chain)
        for w in s:
            for i in short_sequences(chain + [w],length,end):
                yield i

for m in range(5, 100):
    seq = tryimpove(seq,m)

Natürlich musste ich das Programm auch manuell stoppen.


Wie lange dauert es, bis Sie Ihr Ergebnis erhalten?
Hacketo

Etwa eine Stunde, um die 1090-Sequenz zu generieren, und eine weitere Stunde, um die lokale Suche durchzuführen.
Jakube

5

PHP, Jahre 1742 Jahre 1795

Ich habe mit PHP rumgespielt. Der Trick besteht definitiv darin, die Liste auf die ungefähr 20.000 zu bringen, die tatsächlich gültig sind, und den Rest einfach wegzuwerfen. Mein Programm macht dies iterativ (einige Wörter, die es in der ersten Iteration wegwirft, bedeuten, dass andere nicht mehr gültig sind).

Mein Code ist schrecklich, er verwendet eine Reihe globaler Variablen, er belegt viel zu viel Speicher (er speichert eine Kopie der gesamten Präfixtabelle für jede Iteration) und es hat buchstäblich Tage gedauert, bis ich mein aktuelles Bestes gegeben habe, aber er verwaltet es immer noch gewinnen - fürs Erste. Es beginnt ziemlich schnell, wird aber mit der Zeit immer langsamer.

<?php

  function show_list($list)
  {
      $st="";
      foreach ($list as $item => $blah)
      $st.="$item ";
      return rtrim($st);
  }

  function mysort($a,$b)
  {
      global $parts;
      $a_count=isset($parts[substr($a,-3,3)])?count($parts[substr($a,-3,3)]):0;
      $b_count=isset($parts[substr($b,-3,3)])?count($parts[substr($b,-3,3)]):0;
      return $b_count-$a_count;
  }  

  function recurse($line,$list,$parts)
  {
    global $lines; 
    global $max;
    global $finished;
    global $best;
    $end=substr($line,-3,3);
    $count=0;
    if ($finished)
        return;
    if (isset($parts[$end]))
    {
        $maxp=count($parts[$end])-1;
        if ($maxp<0)
            return;
        $randa=array();
        for ($a=1;$a<3;$a++)
        {
            $randa[mt_rand(0,$maxp)]=1;
        }
        $n=mt_rand(0,$maxp);

        foreach ($parts[$end] as $key => $endpart)
        {

            if (!isset($list[$endpart]))
            {
                $this_part=$parts[$end];
                unset($this_part[$key]);
                $new_parts=$parts;
                unset($new_parts[$end][$key]);
                $list[$endpart]=1;
                recurse($endpart,$list,$new_parts);
                unset($list[$endpart]);
            }
        }

    }
    $count=count($list);
    if ($count>$max)
    {
        //echo "current best: $count\n";
        file_put_contents('best.txt',show_list($list) . "\n",FILE_APPEND);
        $max=$count;
        $best=$list;
    }
  }

  function cull_lines(&$lines)
  {
      global $parts;
      do 
      {    
          $wordcount=count($lines);
          $parts=array();$end_parts=array();
          foreach ($lines as $line)
          {
              if (strlen($line)<3)
                continue;
              $parts[substr($line,0,3)][]=$line;
              if (strlen($line)>3)
                $end_parts[substr($line,-3,3)][]=$line;
          }
          foreach ($lines as $key => $line)
          {
              $end=substr($line,-3,3);
              if (strlen($line)<3 || !isset($parts[$end]) || !isset($end_parts[substr($line,0,3)] ) )
                unset($lines[$key]);
          }
          foreach ($parts as $part)
          {
            if (count($part)==1)
            {
                $source_part=mt_rand(0,count($part)-1);
                $this_part = substr($part[0],0,3);
                $this_min = 10000;
                $this_key = 0;
                if (strlen($part[$source_part])==3)
                {
                    foreach ($lines as $key => $line)
                    if ($line == $part[$source_part])
                    {
                            unset($lines[$key]);
                            break;
                    }
                }
                elseif (isset($end_parts[$this_part]))
                {
                    foreach ($end_parts[$this_part] as $key => $end_part)
                    {
                        if (isset($parts[substr($end_part,0,3)]))
                        {
                            $n=count($parts[substr($end_part,0,3)]);
                            if ($n<$this_min)
                            {
                                $this_min=$n;
                                $this_key=$key;    
                            }
                        }
                    }

                    foreach ($lines as $key => $line)
                    if ($line == $part[$source_part])
                    {
                            unset($lines[$key]);

                    }
                    elseif ($line == $end_parts[$this_part][$this_key])
                    {
                        $lines[$key].=' ' . $part[$source_part];
                    }
                }

            }
          }
          echo "$wordcount words left\n";
      }
      while ($wordcount!=count($lines));
  }

  ini_set('xdebug.max_nesting_level',10000);
  ini_set('memory_limit','1024M');
  $lines = explode("\n",file_get_contents('words.txt'));
  cull_lines($lines);
  $max=0;
  foreach ($parts as $key=>$part)
    usort($parts[$key],'mysort');    

  $n=count($lines);
  foreach ($lines as $rand => $blah)
  {
      if (mt_rand(0,$n)==1)
        break;
  }
  $rand=$lines[$rand];
  $line[$rand]=1;
  echo "Starting with $rand...\n";
  recurse($rand,$line,$parts);
  unset($line[$rand]);

?>

Eine offensichtliche Verbesserung wäre die Verwendung eines verwaisten Wortes für Start und Ziel.

Wie auch immer, ich weiß wirklich nicht, warum meine Pastebin-Liste hier in einen Kommentar verschoben wurde. Sie ist zurück als Link zum Pastebin, da ich jetzt meinen Code eingefügt habe.

http://pastebin.com/Mzs0XwjV


Ich habe den Code aus dem Pastebin in Ihre Antwort aufgenommen, dann müssen wir uns nicht auf eine externe Domain verlassen. Falls Pastebin ausfällt, können wir Ihren Code hier immer noch sehen.
ProgramFOX

Nun, ich war froh, zumindest für kurze Zeit die gewinnende Antwort zu haben.
Gute

Oh, jetzt sehe ich, dass ich die Liste Ihrer Antwort nicht hätte hinzufügen sollen; Ich war ein bisschen verwirrt und habe Code und Wortliste vertauscht und die Liste in Ihre Antwort aufgenommen. Das tut mir leid.
ProgramFOX

4

Python: 1702 - 1704 - 1733 Wörter

Ich habe ein Diktat verwendet, um allen Wörtern alle Präfixe zuzuordnen

{
    "AOL" : [
        "AOL", "AOL's"
    ],...
    "oct" : [
         "octet","octets","octette's"
    ],...
}

Kleine Verbesserung bearbeiten : Entfernen aller uselessWörter am Anfang, wenn ihre Suffixe nicht in der Präfixliste enthalten sind (wäre natürlich ein Endwort)

Nehmen Sie dann ein Wort in die Liste und durchsuchen Sie die Präfixkarte wie einen Baumknoten

import sys, fileinput
def p(w):return w[:3]

class Computing:
    def __init__(_):
        _.wordData = []; _.prefixes = {}
        _.seq = []; _.bestAttempt = []
        _.stop = False
        for l in fileinput.input():
            word = l.strip()
            if len(word) > 2:_.wordData.append(_.addPfx(word, p(word)))
        _.rmUseless();_.rmUseless()
        _.fromI = 0; _.toI = len(_.wordData)

    def rmUseless(_):
        for w in _.wordData:
            if not w[-3:] in _.prefixes: _.wordData.remove(_.rmPfx(w,p(w)))

    def addPfx(_, w, px):
        if not px in _.prefixes:_.prefixes[px] = []
        _.prefixes[px].append(w)
        return w
    def rmPfx(_,w,px):
        _.prefixes[px].remove(w)
        if len(_.prefixes[px]) == 0:del _.prefixes[px];
        return w

    def findBestSequence(_):
        def pickItem():
            r = None
            if _.fromI < _.toI:r = _.wordData[_.toI-1];_.toI -= 1;
            return r
        while not _.stop:
            w = pickItem()
            if not w:break;
            _.seq = [_.rmPfx(w,p(w))]
            _.checkForNextWord()
            _.addPfx(w, p(w))

        print " ".join(_.bestAttempt)

    def checkForNextWord(_):
        _.stop = len(_.seq) >= 1733
        cw = _.seq[-1]
        if not _.stop:
            if cw[-3:] in _.prefixes:
                lW = []
                for word in _.prefixes[cw[-3:]]:
                    if not word[-3:] in lW:
                        _.seq.append(_.rmPfx(word,p(word)))
                        _.checkForNextWord()
                        if _.stop :break;
                        _.addPfx(_.seq.pop(), p(word))
                        lW.append(word[-3:])
                    if _.stop :break;
        if len(_.bestAttempt) < len(_.seq):_.bestAttempt = _.seq[:];

sys.setrecursionlimit(6000)
Computing().findBestSequence()

Das Programm benötigt eine Reihe von Wörtern, um zu wissen, wann aufhören kann, wie 1733in der Methode zu findencheckForNextWord̀

Das Programm benötigt den Dateipfad als Argument

Nicht sehr pythonisch, aber ich habe es versucht.

Es dauerte weniger als 2 Minuten , diese Sequenz zu berechnen: volle Leistung :

études entsalzen aß Ateliers ... am ehesten geniale ousters


4

Ergebnis: 249 500 1001

Aachen -> Henne -> von nun an -> leidenschaftlich -> mit sich bringen -> ail -> ailed -> led -> ledger -> gerbil -> bilateral -> rallye -> genial - -> verdrängt -> mühsam -> ouster -> terabit -> bit -> bitched -> hedgehog -> hog -> hogan -> gander -> entgleisen -> querruder -> Beginn -> Ende -> Ende -> Bestätigung -> Folge -> Hauptbücher -> Ersatze -> Schwung -> festgestellt -> Hecke -> Reihe -> Ruderboot -> Hafer - -> oaten -> ten -> tenable -> bleach -> ache -> cheapen -> pen -> bestraft -> zestful -> fulcra -> crab -> rabbinical -> Kalebasse -> Asche -> beschämt -> Medaille -> Tal -> Ale -> alarmiert -> mühsam -> schlau ->schlaueste -> etabliert -> hes -> zögerlich -> ameise -> antazida -> apfelwein -> entgleist -> leisten -> gestiert -> mühsam -> essay -> sagen - -> sagen -> genial -> schlauheit -> aufsatz -> genial -> verdrängen -> genial -> essayist -> isthmus -> muskateller -> katze -> kataklysmisch -> Mäuse -> Eis -> Eisberg -> Erg -> Ergonomie -> Mikra -> Krabben -> Bett -> Bettelei -> Lesben -> Antwort -> waren -> hier - -> aufrichten -> einnehmen -> aufbauen -> einnehmen -> einnehmen -> ion -> ionisieren -> ionisieren -> null -> erodieren -> ode -> oden -> entsalzen -> testen -> aufbauen -> mit sich bringen -> Barren -> bekommen -> bekommen ->Mieter -> Antagonist -> Isthmus -> Sesam -> Amöben -> Basal -> Salaamed -> Medaillon -> Ionisieren -> Einreiben -> Einlassen -> Ins -> Insane - -> Anekdoten -> Talkum -> Alkohol -> Halten -> Alt -> Höhle -> Denaturieren -> Harnstoff -> Erreichen -> Schmerzen -> Hecken -> gestates -> testbar -> gebleicht -> hecken -> ingrates -> testament -> verwickeln -> glänzend -> medaillons -> onshore -> erz -> oregano -> anoden - -> entsalzen -> einschmeicheln -> beweisen -> tester -> terabits -> sein -> sich selbst -> elf -> elfin -> fin -> finagle -> glänzend -> einschmeichelnd -> einschmeichelnd -> Glyzerin -> Schwarte -> Verschuldung -> Essenzen ->Kaiserschnitt -> Verantwortlicher -> Tribüne -> Sie -> Herold -> Erle -> Entgleisen -> Zutat -> Verwicklung -> Verwicklungen -> Läsion -> Ionosphäre -> Erektion - -> ionospheres -> resale -> alerting -> ingresses -> sesames -> mes -> mesas -> sash -> ashcan -> can -> canard -> ardor -> dorkiest -> Nachlässe -> Hoden -> Hoden -> Reiniger -> nerdiest -> geschätzt -> Einmischungen -> Pächter -> siehe -> ausgesät -> Widmungen -> Hoden - -> Senate -> Testamente -> Wertschätzung -> Eingewachsene -> Eigene -> Besitzer -> Nerven -> Vesikel -> Sauberste -> Ester -> Terabyte -> hoden -> gewebe -> verklagen -> wildleder -> ödeme -> abmagern ->Testosteron -> Eins -> Eins -> Nest -> Ästheten -> Testy -> Sty -> Styes -> Ja -> Yeshivas -> Gefäß -> Lärchen -> zögernd - -> glycerin -> ungenießbar -> bleichmittel -> zögert -> aussagen -> ingrate -> aßen -> ateliers

Hier ist mein Code:

import sys
sys.setrecursionlimit(10000)
w=[i for i in open("words.txt").read().split("\n") if len(i)>=3 and "'" not in i]
b=[i[:3] for i in w]
e=[i[-3:] for i in w]
a=[i for i in zip(*(w,b,e))]
def pathfrom(i,a,l):
    longpath=[]
    for j in a:
        if j[1]==i[2]:
            r=pathfrom(j,[m for m in a if m!=j],l+1)
            path=[i]+r[0]
            if r[1]:
                return path,r[1]
            if len(path)>len(longpath):
                longpath=path
    if l>=250:
        return longpath,True
        sys.exit()
    return longpath,False
for i in a[:2]:
    print i
    p=pathfrom(i,[j for j in a if i!=j],1)
    if len(p)>len(chain_):
        chain_=p
        print p
    print p

Bearbeiten: 1001:

http://pastebin.com/yN0eXKZm

Bearbeiten: 500:

Aachen -> Henne -> von nun an -> leidenschaftlich -> mit sich bringen -> ail -> ailed -> led -> ledger -> gerbil -> bilateral -> rallye -> genial - -> verdrängt -> mühsam -> ouster -> terabit -> bit -> bitched -> hedgehog -> hog -> hogan -> gander -> entgleisen -> querruder -> Beginn -> Ende -> Ende -> Bestätigung -> Folge -> Hauptbücher -> Ersatze -> Schwung -> festgestellt -> Hecke -> Reihe -> Ruderboot -> Hafer - -> oaten -> ten -> tenable -> bleach -> ache -> cheapen -> pen -> bestraft -> zestful -> fulcra -> crab -> rabbinical -> Kalebasse -> Asche -> beschämt -> Medaille -> Tal -> Ale -> alarmiert -> mühsam -> schlau ->schlaueste -> etabliert -> hes -> zögerlich -> ameise -> antazida -> apfelwein -> entgleist -> leisten -> gestiert -> mühsam -> essay -> sagen - -> sagen -> genial -> schlauheit -> aufsatz -> genial -> verdrängen -> genial -> essayist -> isthmus -> muskat -> katze -> kataklysmisch -> Mäuse -> Eis -> Eisberg -> Erg -> Ergonomie -> Mikra -> Krabben -> Bett -> Bettelei -> Lesben -> Antwort -> waren -> hier - -> aufrichten -> einnehmen -> aufbauen -> einnehmen -> einnehmen -> ion -> ionisieren -> ionisieren -> null -> erodieren -> ode -> oden -> entsalzen -> testen -> aufbauen -> mit sich bringen -> Barren -> bekommen -> bekommen ->Mieter -> Antagonist -> Isthmus -> Sesam -> Amöben -> Basal -> Salaamed -> Medaillon -> Ionisieren -> Einreiben -> Einlassen -> Ins -> Insane - -> Anekdoten -> Talkum -> Alkohol -> Halten -> Alt -> Höhle -> Denaturieren -> Harnstoff -> Erreichen -> Schmerzen -> Hecken -> gestates -> testbar -> gebleicht -> hecken -> ingrates -> testament -> verwickeln -> glänzend -> medaillons -> onshore -> erz -> oregano -> anoden - -> entsalzen -> einschmeicheln -> beweisen -> tester -> terabits -> sein -> sich selbst -> elf -> elfin -> fin -> finagle -> glänzend -> einschmeichelnd -> einschmeichelnd -> Glyzerin -> Schwarte -> Verschuldung -> Essenzen ->Kaiserschnitt -> Verantwortlicher -> Tribüne -> Sie -> Herold -> Erle -> Entgleisen -> Zutat -> Verwicklung -> Verwicklungen -> Läsion -> Ionosphäre -> Erektion - -> ionospheres -> resale -> alerting -> ingresses -> sesames -> mes -> mesas -> sash -> ashcan -> can -> canard -> ardor -> dorkiest -> Nachlässe -> Hoden -> Hoden -> Reiniger -> nerdiest -> geschätzt -> Einmischungen -> Pächter -> siehe -> ausgesät -> Widmungen -> Hoden - -> Senate -> Testamente -> Wertschätzung -> Eingewachsene -> Eigene -> Besitzer -> Nerven -> Vesikel -> Sauberste -> Ester -> Terabyte -> hoden -> gewebe -> verklagen -> wildleder -> ödeme -> abmagern ->Testosteron -> Eins -> Eins -> Nest -> Ästheten -> Testy -> Sty -> Styes -> Ja -> Yeshivas -> Gefäß -> Lärchen -> zögernd - -> Glycerin -> ungenießbar -> bläscher -> Keratin -> Zinn -> Tinktur -> Harnröhren -> Schlingel -> Calamin -> nicht vermittelbar -> am trostlosesten -> ästhetisch -> tic -> tick -> ickiest -> schätzbar -> bleariest -> estimator -> tor -> torched -> hedonistisch -> ticker -> kerchieves -> vesicles -> lessens - -> versunken -> Zeder -> wagen -> sind -> Fläche -> erreichbar -> meckern -> essen -> essbar -> bluten -> entgleisen -> betreten -> Begriff -> Hermelin -> unbeschreiblich -> piepste -> Pädagoge -> Brille -> Nachlese ->beantwortet -> rot -> rotbrust -> aster -> termagant -> antagonistisch -> ticket -> kessel -> rum -> rumbas -> basalt -> altar -> teer - -> Vogelspinnen -> Lasagne -> knorrigste -> Entfremdung -> eingegebene -> Rotkappe -> Kappe -> fähig -> Pieptöne -> Epsilon -> einsamste -> Entfremdungen -> Gestikulieren -> Redcaps -> Apsis -> Pseudonym -> Nymphomanie -> Niacin -> Cinchonas -> Nasal -> Salable -> Blend -> End -> Endanger -> Geriatrie - -> reis -> eisgebunden -> undeceives -> vesper -> per -> perambulator -> tore -> ores -> weiterverkauf -> weniger -> sera -> era -> Ären -> Hautausschlag -> Asche -> Handlanger -> Mann -> Manacle -> sauberste ->Östrogen -> Gendarmen -> Mescal -> Calcin -> ineffizient -> unterhaltsam -> Glycerin -> Rolle -> Oleander -> Störung -> Unterhaltung -> unterhält -> unersättlich - -> Blended -> Deduced -> Zedern -> Arsen -> Nice -> Eisfach -> Box -> Boxcar -> Auto -> Caracul -> Cullender -> Deranges -> Gesten -> Neuplanen -> Unterricht -> Sohn -> Sonar -> Nark -> Bogen -> Arkade -> adenoidal -> Täler -> Vermieter -> Sorbet -> Wette - -> wetteifern -> ken -> kens -> ensemble -> mixer -> verspotten -> idee -> diakon -> con -> konkav -> avenger -> germane -> anämie -> miauten -> heiraten -> heiraten -> deduzieren -> mischen -> fesseln ->Alles -> Alles -> Laien -> Verweilen -> Weg -> Wanderer -> Nachzügler -> Ran -> Rancher -> Angekündigt -> Selbstbehalt -> Gesegnet -> Limousine - -> getanzt -> abgetreten -> abgegangen -> ameisenbär -> benannt -> eingemischt -> omegas -> gas -> wunde -> ashram -> ram -> ramble -> blies -> lewder -> derides -> descend -> gefährdet -> redcoat -> eid -> atherosklerose -> sis -> sisal -> salat -> ladder -> -> Derivate -> Gefäße -> Selten -> Domänen -> Eingeschrieben -> Wanze -> Wanze -> Bugaboo -> Boo -> Boobed -> Bedder -> Ableitungen -> Spuren -> Gesundheit -> Entweder -> Heraldisch -> Würfel -> Eisbrecher -> Kerosin -> Einlauf -> E-Mail ->Beschwerden -> Inthronisation -> Begeisterung -> Gebrauch -> gebraucht -> Sedierung -> Terminator -> Toreador -> ruhend -> Antebellum -> Hexenschuss -> vor -> qualvoll - -> Glykogen -> Geschlecht -> Dermis -> Missgeschicke -> Aufheben -> Unanständig -> Enthusiast -> Beruhigungsmittel -> Gewandung -> Enthusiast -> Erstaunen -> Tiraden -> Nachkomme -> Vorgänger -> Verführer -> Eiskappe -> Kondensator -> Qual -> Verführer -> Cedille -> Lama -> Amalgam -> Schachzug -> Hündinnen -> zögert - -> aussagen -> einschmeicheln -> essen -> ateliersGeschlecht -> Dermis -> Missgeschicke -> Aufheben -> Unanständig -> Enthusiast -> Beruhigungsmittel -> Gewandung -> Enthusiast -> Erstaunen -> Tiraden -> Nachkomme -> Vorgeschichte - -> locken -> Eiskappe -> Kondensator -> quälen -> locken -> Cedilla -> Lama -> Amalgam -> Schachzug -> Hündinnen -> zögern -> aussagen -> ingrate -> aß -> ateliersGeschlecht -> Dermis -> Missgeschicke -> Aufheben -> Unanständig -> Enthusiast -> Beruhigungsmittel -> Gewandung -> Enthusiast -> Erstaunen -> Tiraden -> Nachkomme -> Vorgeschichte - -> locken -> Eiskappe -> Kondensator -> quälen -> locken -> Cedilla -> Lama -> Amalgam -> Schachzug -> Hündinnen -> zögern -> aussagen -> ingrate -> aß -> ateliers


2

Mathematica 1482 1655

Etwas zu beginnen ...

dict=Import["words.txt"];
words=Union@Select[StringSplit[dict],(StringFreeQ[#,"'s"])\[And]StringLength[#]>2
  \[And]LowerCaseQ@StringTake[#,1]&]

Links sind die Kreuzungspräfixe und -suffixe für Wörter.

prefixes=Union[StringTake[#,3]&/@words];
suffixes=Union[StringTake[#,-3]&/@words];
links=Intersection[prefixes,suffixes];
linkableWords=(wds=RandomSample@Select[words,MemberQ[links,StringTake[#,3]]\[And]MemberQ[links,StringTake[#,-3]]& ])/.
w_String:> {w,StringTake[w,3],StringTake[w,-3]}

Kanten sind alle gerichteten Links von einem Wort zu anderen Wörtern:

edges[{w_,fr_,fin_}]:= Cases[linkableWords,{w1_,fin,_}:> (w\[DirectedEdge]w1)]
allEdges=Flatten[edges/@linkableWords];
g=Graph@allEdges;

Finden Sie einen Weg zwischen "heilen" und "Lust".

FindPath[g, "begin", "end", {1480, 3000}, 1][[1]]

Ergebnis (1655 Wörter)

{"mend", "endorser", "server", "vertebral", "rallying", "ingrains", 
"insurrectionist", "isthmus", "mussels", "elsewhere", "erection", 
"ionizes", "zestful", "fullness", "essaying", "ingeniously", 
"slyest", "estimator", "tornados", "doses", "sesame", "amebic", 
"bicycled", "ledges", "gestation", "ionizing", "ingratiates", 
"testifying", "ingesting", "inglorious", "ouster", "terminated", 
"tediousness", "essayist", "isthmuses", "session", "ion", 
"ionization", "ionospheres", "resubmitted", "tedious", "ousting", 
"ingest", "ester", "terminates", "testicle", "cleanliness", "essay", 
"say", "saying", "ingratiating", "ingratiatingly", "glycerine", 
"inefficient", "entrances", "cesarians", "answering", "ingenious", 
"ousted", "tediously", "sly", "slyness", "essences", "cesareans", 
"answer", "were", "erecting", "ingredient", "enterprises", 
"sessions", "onshore", "oregano", "anorak", "raking", "ingraining", 
"ingrown", "owner", "nerdiest", "estranging", "ingot", "gotten", 
"tendonitis", "tissue", "suede", "edelweiss", "issuing", "ingestion", 
"ionosphere", "erections", "onset", "settles", "lesion", "ionizer", 
"zeroing", "ingresses", "sesames", "mesmerizing", "ingrates", 
"testes", "testiest", "estrangement", "entail", "ail", "ailment", 
"entice", "icecap", "captivates", "testy", "sty", "stylistic", 
"tickles", "lessee", "seeded", "deductibles", "lesser", 
"servicewoman", "many", "anymore", "ores", "resourceful", "fullback", 
"acknowledgment", "entertainer", "nerves", "vest", "esteemed", 
"mediates", "testament", "entered", "redbreast", "astonishes", 
"hesitatingly", "glycogen", "genera", "eras", "rashes", "hesitates", 
"testicles", "lest", "establishment", "entwines", "nest", "estates", 
"testates", "testosterone", "oneself", "elf", "elfin", "fingered", 
"redcaps", "apse", "pseudonym", "nymphomania", "niacin", "cinemas", 
"masochistic", "tickled", "led", "ledger", "geriatric", "rice", 
"icebreaker", "kerosine", "inexperienced", "ceded", "deductible", 
"blew", "lewder", "derivable", "blemished", "hedgerow", "rowel", 
"welfare", "arena", "enamel", "melded", "dedicates", "tester", 
"terabit", "bitmap", "mapped", "pedicures", "restored", "redeemer", 
"merchantman", "manipulator", "torpedos", "dosed", "seduced", 
"cedilla", "llano", "another", "heretic", "tic", "ticker", "keratin", 
"tinctures", "restaurateur", "euros", "rosettes", "testable", 
"bleaker", "kerosene", "energizer", "zero", "eroded", "deduced", 
"cedar", "dare", "ares", "respondent", "entranced", "cedillas", 
"lasagnas", "nastiest", "esthetic", "ticket", "ketches", "hes", 
"hesitant", "antipasto", "stoppered", "redounded", "deducible", 
"bleeped", "pedant", "antimatter", "terminable", "blent", "enthuse", 
"user", "serenade", "adenoidal", "dales", "lessen", "sentimental", 
"talker", "kerchieves", "vestry", "try", "tryout", "outdone", "ones", 
"nestles", "lesson", "songwriter", "terrapin", "pinched", 
"hedonistic", "tick", "ickiest", "established", "hedgehog", "hogan", 
"gander", "derringer", "gerbil", "billboard", "ardor", "dorkiest", 
"estrogen", "gent", "entirety", "etymological", "calk", "alkalis", 
"lissome", "omegas", "gasolene", "enema", "emaciates", "test", 
"estranges", "gestured", "redeemed", "medic", "diced", "cedars", 
"arsenic", "nice", "iceberg", "erg", "ergonomic", "microcomputer", 
"terser", "sergeant", "antipastos", "tost", "osteopathy", "thy", 
"thymus", "mussiest", "estimable", "blend", "endeavored", "redound", 
"undercover", "verbal", "balk", "alkali", "alibi", "ibis", "bison", 
"sonar", "narcosis", "sister", "terraced", "cede", "edema", 
"emancipator", "torpor", "portraiture", "urea", "reassign", 
"ignoble", "blenched", "hedges", "gesture", "urethras", "raspy", 
"spyglass", "ass", "assailant", "antiquarians", "answered", 
"reduced", "cedes", "despair", "airfares", "resumed", "medicine", 
"ineffable", "bleacher", "herdsmen", "menhaden", "dent", 
"entitlement", "enticement", "entangle", "gleamed", "medullas", 
"lassie", "sieve", "even", "vender", "derivatives", "vessel", 
"selectmen", "mentor", "toreador", "dormer", "meringue", "guerrilla", 
"llanos", "nosedove", "overact", "actionable", "bleeps", "epsilon", 
"longhorn", "ornament", "entreaty", "atypical", "calendar", "dares", 
"resurgent", "entreat", "eater", "term", "ermine", "inedible", 
"bleeder", "derrières", "resentful", "fulcra", "crabbed", 
"bedevilment", "entwine", "inelegant", "antitoxins", "inspired", 
"redder", "derides", "descendant", "antihistamine", "inequitable", 
"bleat", "eaten", "tenured", "redcap", "capstans", "answerable", 
"blender", "deranges", "gestures", "restart", "arteriosclerosis", 
"sis", "sisal", "saltpeter", "terrifyingly", "glycerin", "rink", 
"inkwell", "ellipsis", "sisterhood", "oodles", "lessor", "sorrowed", 
"wedges", "gesundheit", "either", "hereafter", "termite", "iterator", 
"tornado", "adobes", "bespoken", "ken", "kens", "ensnare", "area", 
"rear", "earful", "fulfil", "fillet", "letdown", "ownership", 
"hipped", "pediatric", "richer", "heretical", "calculus", "lusher", 
"heraldic", "dice", "icebound", "underscored", "redskins", "instant", 
"antiperspirant", "anthropomorphic", "hiccup", "cup", "cups", 
"upstage", "agendas", "dashingly", "glycerol", "role", "oleo", 
"leonine", "ineluctable", "blessed", "sedatives", "vesicles", 
"lessens", "ensured", "redefine", "inextinguishable", "bleach", 
"achoo", "hooch", "ocher", "hero", "erode", "ode", "odes", "desktop", 
"topple", "pleasured", "redeveloped", "pediment", "entrapped", 
"pederasty", "stylus", "lush", "usher", "hermaphrodite", "item", 
"tempos", "postpaid", "aide", "ideogram", "rampart", "artisan", 
"sandhog", "hog", "hogwash", "ash", "ashram", "rammed", "mediocre", 
"crestfallen", "lend", "endow", "downcast", "astronomer", 
"merriment", "entrant", "antiwar", "warden", "dentures", "restful", 
"fulfillment", "entrapment", "enthrall", "allay", "layout", 
"outbound", "underclassman", "manhole", "oleander", "dermis", 
"misused", "sedater", "terrific", "fiche", "cheapens", "ensnares", 
"restrains", "insolent", "entombed", "bedraggle", "gleeful", 
"fulfilment", "entrenchment", "entrap", "rapper", "persistent", 
"enthronement", "enthusiast", "astute", "uterus", "rustproofed", 
"fedora", "orangeades", "despised", "seducer", "ceramic", 
"microscopic", "picnic", "nicotine", "inexpedient", "entomb", 
"ombudsman", "mantel", "teletypewriter", "terminological", "calif", 
"lifetimes", "mescaline", "inertia", "tiaras", "raster", "terrace", 
"acetaminophen", "henchmen", "menhadens", "enslaves", "vesper", 
"peroxide", "ideograph", "aphid", "hides", "desideratum", "tumor", 
"mortgagee", "geegaw", "gawk", "awkward", "ardent", "enthused", 
"sediment", "enter", "termed", "mediaeval", "valentine", "inexact", 
"actives", "vestment", "entourage", "agent", "entryway", "wayside", 
"idea", "dear", "earache", "checkups", "upsides", "descent", 
"entertainment", "entomological", "calicos", "cosign", "ignored", 
"redcoat", "oaten", "tensed", "sedan", "dank", "anklet", "lettered", 
"redskin", "kingpin", "pinups", "ups", "upshot", "hotbed", 
"bedtimes", "mes", "messenger", "germicides", "destitute", "utensil", 
"silencer", "cervix", "vixens", "ensign", "ignorant", "antipasti", 
"stimulus", "lusty", "stymie", "miens", "enslave", "averred", 
"redrew", "rewritten", "tenpins", "instructor", "torrent", 
"entertains", "insult", "ultrasound", "undersides", "despoil", 
"oilcloth", "other", "hereupon", "pondered", "redundant", "anthill", 
"ill", "illicit", "citizens", "ensnared", "rediscovered", "redesign", 
"ignoramus", "muskmelon", "longer", "gerrymander", "deride", "ideas", 
"easy", "asylum", "lumbermen", "mendicant", "antlered", "redevelop", 
"lopes", "pester", "terrapins", "instil", "tildes", "deserves", 
"vesicle", "cleave", "avenger", "germane", "anemia", "miasmas", 
"mash", "ashy", "shy", "shyster", "termagant", "antiaircraft", 
"afterglow", "lowland", "and", "androgen", "genitalia", "liars", 
"arson", "sonatas", "taste", "stepsister", "termini", "initiator", 
"tor", "torn", "ornamental", "tallow", "lowered", "red", "redraft", 
"aft", "aftertaste", "stereotypes", "pesky", "skyrocket", 
"kettledrum", "rummer", "merciful", "fulsome", "omens", "ensures", 
"resultant", "antennas", "nasal", "saleswoman", "mane", "anemometer", 
"terrains", "insightful", "fulcrum", "rumbas", "baseman", 
"mannikins", "insures", "resound", "underpass", "assassins", "inset", 
"settee", "teethe", "theological", "calf", "alfresco", "scornful", 
"fulfill", "illustrator", "torpid", "pidgin", "gins", "instal", 
"talc", "alcove", "overtakes", "kestrel", "relabel", "beleaguered", 
"redraw", "rawhide", "identical", "caliber", "beret", "retrace", 
"acetylene", "enemas", "massacred", "redeploys", "oyster", 
"terminator", "tortillas", "last", "astronomical", "calliope", 
"operator", "tort", "orthographic", "hiccups", "upstart", 
"artificer", "cervical", "callus", "lustre", "trend", "endeavor", 
"vortex", "textures", "researcher", "heroins", "instill", "illegal", 
"galloped", "pedagogical", "callipered", "rediscover", "vertebra", 
"brasher", "herbicides", "descry", "cryptogram", "ramrod", "rodeo", 
"deodorizer", "zeros", "rosebush", "ushered", "redden", "denatures", 
"reset", "setups", "upside", "ides", "describes", "besides", 
"desperado", "adores", "reshuffle", "flea", "leaflet", "lethal", 
"halibut", "but", "button", "tonic", "niche", "cherubim", "bimbos", 
"bosun", "sunk", "unkind", "indentures", "resend", "endures", 
"restorer", "reran", "rang", "anger", "germicide", "ideological", 
"calabash", "ashamed", "medical", "caloric", "rickshas", "hasten", 
"tendon", "donkey", "keyword", "ordains", "insecticides", "desires", 
"resin", "sins", "inspector", "torrid", "rid", "rides", "despot", 
"potpie", "piebald", "aldermen", "menace", "ace", "acerbic", "bicep", 
"cephalic", "lichen", "hennas", "nasty", "styes", "yesterday", "day", 
"daybed", "bedridden", "dental", "talisman", "mankind", "indignant", 
"antique", "questionnaires", "resubmit", "mitten", "tenfold", "old", 
"olden", "denudes", "design", "ignores", "resumes", "mesdames", 
"mesas", "sass", "assemblywoman", "mangle", "glee", "leeway", 
"waylay", "laywomen", "menswear", "ear", "earldom", "domains", "ins", 
"instrumental", "tall", "all", "allegorical", "calm", "almanac", 
"nacre", "credit", "dittos", "tossup", "superman", "mandolin", 
"linesman", "manacle", "cleverer", "rerun", "runaway", "way", 
"wayfarer", "reruns", "unshaven", "ventures", "resell", "elliptical", 
"calmer", "mercuric", "ricochet", "heterodoxy", "oxymora", 
"orangutang", "angina", "inapt", "apt", "aptitudes", "descend", 
"endear", "earlobes", "bestowal", "walleyes", "yes", "yeshivas", 
"vassal", "saltcellar", "larval", "valiant", "anthropological", 
"calfskin", "kind", "inductee", "tee", "teenager", "gerund", 
"underclass", "assemblyman", "manservant", "antelopes", "peso", 
"esoteric", "rickshaw", "hawser", "servicewomen", "mental", 
"tallyhos", "hospital", "talon", "longshoremen", "men", "menthol", 
"holography", "phylum", "lumberman", "manikin", "kingpins", 
"install", "allures", "resuscitator", "tortilla", "llamas", 
"massacres", "resistor", "tormentor", "torque", "queasy", 
"asymmetric", "ricksha", "sharped", "pedlar", "largos", "gossamer", 
"merganser", "service", "icebox", "boxer", "xerography", "physical", 
"calculator", "tortures", "resonant", "anticlimax", "maxima", "imam", 
"mammon", "monograph", "aphelia", "liaison", "sonic", "nicknamed", 
"media", "diametrical", "calliper", "performed", "medulla", "llama", 
"amalgam", "gamins", "insulin", "lineman", "mantra", "transplant", 
"antigen", "genres", "respires", "resold", "oldie", "diesel", 
"seldom", "domed", "medieval", "valor", "lordship", "hipper", "per", 
"perspires", "restores", "restructures", "resort", "orthodoxy", 
"oxygen", "gentlemen", "menopausal", "saltpetre", "treacle", 
"cleaver", "verdigris", "risen", "send", "end", "endemic", 
"microfiche", "checkout", "outclass", "assault", "ultraviolet", 
"let", "letterbox", "boxcar", "carom", "roman", "manifesto", 
"stovepipes", "pesticides", "described", "bedsides", "descant", 
"anthem", "hempen", "penguins", "insignificant", "antebellum", 
"lumbar", "barracudas", "dash", "ashcan", "cannonball", "allover", 
"verbena", "enamor", "morgue", "guerrillas", "lash", "ashen", 
"henchman", "mandolins", "inspires", "resistant", "antechamber", 
"bereave", "aver", "vermin", "minim", "nimbus", "bus", "businessman", 
"mantras", "rasp", "asphalt", "altogether", "her", "hereabout", 
"outcast", "astrological", "calisthenic", "nicknames", "mescal", 
"calliopes", "pesetas", "tassel", "selectman", "mannikin", 
"kinswoman", "man", "manic", "nicer", "cerebra", "bravado", "adobe", 
"obeisant", "antiparticle", "clever", "versus", "sushi", "shirr", 
"irrelevant", "antelope", "open", "pentagon", "gonad", "nadir", 
"directorship", "hippopotami", "amid", "midwifed", "fedoras", 
"rasher", "herbal", "ball", "allot", "lot", "lotus", "tussle", 
"sledgehammer", "merchant", "ant", "antidepressant", "anther", 
"heraldry", "drywall", "allegros", "rosebud", "budgerigar", 
"garbageman", "manikins", "inscribes", "bestow", "townsmen", "menu", 
"enures", "restaurant", "antithetical", "calico", "icon", "confound", 
"underbid", "bidden", "denser", "seraphic", "hiccuped", "pedigree", 
"reeve", "ever", "vertical", "caliper", "perusal", "salami", "amir", 
"mires", "restraint", "interstellar", "larkspur", "puritanical", 
"calligrapher", "herdsman", "manatee", "teepee", "peeve", "everyday", 
"daydreamer", "meres", "result", "ultimatum", "tumbril", "rill", 
"illogical", "calligraphy", "physic", "sickbed", "bedsores", 
"resolver", "vertebras", "rascal", "call", "allergenic", "nickname", 
"amebas", "baste", "stepson", "son", "sonnet", "net", "nether", 
"heros", "rosins", "insular", "larvas", "vast", "astrakhan", 
"handyman", "manicures", "resins", "instep", "tepid", "pidgins", 
"inscribed", "bedbug", "bug", "bugbear", "earwax", "waxen", 
"xenophobia", "biathlon", "longhair", "airstrip", "ripple", "pleas", 
"eastbound", "underachiever", "verbatim", "timbre", "brew", 
"rewound", "underplay", "laywoman", "mandarins", "insofar", "farm", 
"armpit", "pitcher", "herald", "alderman", "mangos", "gossip", 
"sipped", "pedagogue", "guerillas", "laser", "serape", "aped", 
"pederast", "astound", "underground", "underpins", "insane", 
"anemic", "micra", "crane", "anew", "new", "newscast", "astir", 
"tiro", "ironware", "are", "areas", "east", "astronomic", 
"microchip", "hippopotamus", "mustache", "chervil", "villas", "lass", 
"assassin", "sinew", "newsman", "mangrove", "overtax", "taxicab", 
"cabana", "anathemas", "mast", "astronaut", "author", "horoscope", 
"opera", "eraser", "serfdom", "dominos", "nostrum", "rumpus", "pus", 
"pushcart", "arthropod", "podia", "diatom", "tomboy", "boycott", 
"ottoman", "manhunt", "untidy", "idyllic", "licensee", "seethe", 
"thereabout", "outplay", "layoff", "officer", "cerebrum", "rum", 
"rumple", "plethora", "oracle", "clergyman", "maneuver", "verandas", 
"dashikis", "kisser", "serum", "rumor", "morbid", "bidet", "detach", 
"achiever", "vertex", "text", "extremer", "merino", "inopportune", 
"uneaten", "tensor", "sort", "orthopedic", "dickie", "kielbasas", 
"sashay", "hayloft", "often", "ten", "tenpin", "pinkeye", "eyeball", 
"allegro", "grout", "outfox", "fox", "foxtrot", "rot", "rotund", 
"underwear", "earshot", "hot", "hotshot", "hotel", "telex", 
"lexicon", "congresswoman", "manor", "northbound", "undertow", 
"township", "hippos", "possessor", "sorbet", "betcha", "chart", 
"art", "article", "clear", "earwig", "wigwam", "wampum", "pummel", 
"melodic", "dictum", "tumbrel", "relic", "licit", "citadel", "delay", 
"lay", "laypeople", "plectra", "traumas", "mascot", "cotyledon", 
"donor", "nor", "normal", "malt", "altar", "tart", "artiste", 
"stencil", "cilantro", "trouper", "pericardia", "diadem", "democrat", 
"rattan", "tang", "angstrom", "romper", "perturb", "urban", "bang", 
"angel", "gelatin", "tint", "intros", "rostra", "trapper", 
"persimmon", "monsignori", "origin", "ginkgos", "gospel", "pelvis", 
"visor", "sorghum", "humid", "midair", "air", "airfoil", "oil", 
"oilskin", "kin", "kindergarten", "tentacle", "cleanser", "sermon", 
"monolog", "logarithmic", "microbes", "bestir", "tiros", "rosin", 
"sin", "singleton", "tonsil", "silicon", "con", "constraint", 
"intagli", "glint", "interwove", "overshadow", "downtrodden", 
"dentin", "tin", "tinsel", "sellout", "out", "output", "put", 
"putsch", "schoolmarm", "arm", "armor", "moribund", "underpin", 
"pint", "interloper", "periwig", "wig", "wigwag", "wagon", 
"gonorrhea", "hearten", "tenon", "nonverbal", "balsam", "samovar", 
"varmint", "interviewee", "weeper", "perturbed", "bed", "bedpan", 
"panache", "chestnut", "nut", "nutmeg", "meg", "megalopolis", 
"lissom", "somersault", "ultra", "tram", "ramp", "amputee", "teeth", 
"ethos", "hos", "hostel", "telescopic", "picayune", "uneven", 
"vendor", "dorsal", "salad", "ladybug", "bugaboo", "boomerang", 
"angora", "orangutan", "tandem", "demagogry", "gryphon", 
"honeycombed", "bedlam", "lamb", "ambergris", "risky", "sky", 
"skycap", "capstan", "tannin", "ninepin", "pinpoint", "interpret", 
"retiree", "reefer", "fer", "ferret", "returnee", "needlepoint", 
"interurban", "bantam", "tamp", "ampul", "pullout", "outrun", 
"runabout", "outstrip", "rip", "ripen", "pennon", "nonfat", "fathom", 
"homespun", "puns", "unsubscribes", "besom", "sombre", "breathe", 
"theatre", "tremor", "mortar", "tarpaulin", "lintel", "telethon", 
"honeydew", "dewlap", "lap", "lapel", "pelvic", "victim", "timpani", 
"animus", "muscat", "cat", "catsup", "sup", "superstar", "taro", 
"arousal", "salamis", "misprint", "interwoven", "venom", "nomad", 
"madam", "dam", "dampen", "penicillin", "lint", "intercom", 
"compound", "underpay", "pay", "payoff", "off", "offal", "fallout", 
"outwit", "withal", "halt", "altho", "tho", "thou", "housebound", 
"undergrad", "radio", "diocesan", "sanserif", "riffraff", 
"affidavit", "vitamin", "minicam", "campus", "pussycat", "catamaran", 
"rancor", "cornucopia", "piano", "anon", "non", "nonpartisan", 
"sandbar", "bar", "barren", "renewal", "walkout", "outruns", 
"unsnap", "naphtha", "thalamus", "musky", "skydove", "overrun", 
"run", "runs", "unsheathe", "the", "theorem", "remove", "overreach", 
"ache", "cherub", "rubes", "beseech", "echo", "chosen", "sensor", 
"sorrel", "relay", "layman", "mantillas", "lasagna", "gnat", 
"natures", "resonator", "torus", "russet", "set", "setback", 
"acknowledgement", "entanglement", "entombment", "entourages", 
"gestates", "testing", "ingratiate", "ate", "ateliers", "ersatzes", 
"zest"}

1

Python, 90

umgestülpten deductibles Mieter seesawed wed wedded folgert cesarians Zögern sesames beantwortbar segnet Maschen Ionosphäre Erektion Ionisator Null erodieren ode Oden Deserteur Terminierungen an Land Erzen residieren idealistisch tic kitzelt Lesson Song instill illiberaler Rallyes laufenden ingrains Ingest Gesten entfremdet Antworten Endivien Ornat Entertainer nervös schlaueste Ester ersatzes zestful ändern Sesam Verteidiger anerkennt Geste Harnröhren Hautausschläge zögern Antiklimax-Maxima stellen Sie sich vor, dass Rauschgifte langwierig schlau Essenzen Kaiserschnitte getestet wurden

Zuerst räume ich die Liste manuell auf, indem ich alle lösche

  • Wörter mit einem Großbuchstaben
  • Wörter mit Apostrophen
  • Wörter mit éêèáâàö
  • 1- und 2-Buchstaben-Wörter

das kostet mich höchstens 2 punkte, weil diese wörter nur am anfang oder am ende der kette stehen können, aber es reduziert die wortliste um 1/3 und ich muss mich nicht mit unicode auseinandersetzen.

Als nächstes konstruiere ich eine Liste aller Vor- und Nachsetzzeichen, finde die Überlappung und verwerfe alle Wörter, es sei denn, sowohl das Vor- als auch das Nachsetzzeichen befinden sich im Überlappungssatz. Auch dies spart höchstens 2 Punkte meiner maximal erreichbaren Punktzahl, reduziert jedoch die Wortliste auf ein Drittel der ursprünglichen Größe (versuchen Sie, Ihren Algorithmus für eine mögliche Beschleunigung auf der short_list auszuführen), und die verbleibenden Wörter sind eng miteinander verbunden (mit Ausnahme von 3) -Letterswörter, die nur mit sich selbst verbunden sind). Tatsächlich kann fast jedes Wort von jedem anderen Wort über einen Pfad mit durchschnittlich 4 Kanten erreicht werden.

Ich speichere die Anzahl der Verknüpfungen in einer Adjazenzmatrix, die alle Operationen vereinfacht und es mir ermöglicht, coole Dinge wie n Schritte vorauszusehen oder Zyklen zu zählen ... zumindest theoretisch, da es ungefähr 15 Sekunden dauert, die Matrix zu quadrieren, die ich eigentlich nicht tue Dies während der Suche. Stattdessen beginne ich mit einem zufälligen Präfix und gehe nach dem Zufallsprinzip umher. Entweder wähle ich ein einheitliches Ende und bevorzuge diejenigen, die häufig vorkommen (wie '-ing') oder diejenigen, die seltener vorkommen.
Alle drei Varianten saugen gleich und produzieren Ketten im Bereich von 20 bis 40, aber zumindest ist es schnell. Schätze, ich muss doch Rekursion hinzufügen.

from numpy import *
f = open('words_short.txt')
words = f.read().split() # 62896
f.close()

prefix = [w[:3] for w in words]     # 2292
suffix = [w[-3:] for w in words]    # 2262
common = set(prefix) & set(suffix)  # 1265

PSW = [(p,s,w) for (p,s,w) in zip(prefix, suffix, words) if p in common and s in common] # 28673
common = list(common)
mapping = dict(zip(common, range(len(common)))) # enumerate trigrams

M = zeros((len(common), len(common)), dtype=int) # for fast processing
W = [[[] for i in range(len(common))] for j in range(len(common))] # for reconstruction
for p,s,w in PSW: # build adjacency matrix
    M[mapping[p], mapping[s]] += 1
    W[mapping[p]][mapping[s]].append(w)

def chain(A, rho=0):
    B = array(A)
    links = []
    start = random.randint(len(B))
    links.append(start)
    while 1:
        nextpos = where(B[links[-1],:]>0)[0]
        if len(nextpos)==0: return links
        nextnum = B[links[-1],nextpos]

        p = ones(len(nextnum))/len(nextnum) # pick uniformly
        if rho>0: p = nextnum*1./sum(nextnum) # prioritize many links
        if rho>1: p = 1/p; p = p/sum(p) # prioritize few links

        chosen = random.choice(nextpos, p=p)
        B[links[-1], chosen] -= 1
        links.append(chosen)

def chain2words(L):
    # can only be used once because of .pop()
    z = zip(L[:-1],L[1:])
    res = []
    for p,s in z:
        res.append(W[p][s].pop())
    return res

chains = [chain(M) for i in range(100)]
bestchain = chains[argmax(map(len, chains))]
print ' '.join(chain2words(bestchain))

Ursprünglich wollte ich etwas Ähnliches versuchen , dies aber da dies ein gerichteter Graph mit Zyklen, keine der Standard - Algorithmen für topologische Sortierung, Longest Path, Größter Eulersche Pfad oder Chinesisch Postman Problem arbeiten , ohne schwere Modifikationen.

Und nur weil es gut aussieht, ist hier ein Bild der Adjazenzmatrix M, M ^ 2 und M ^ unendlich (unendlich = 32, ändert sich danach nicht) mit weißen Einträgen ungleich Null
Bildbeschreibung hier eingeben


Sie haben also 90 Punkte? Wir haben bereits mehr als 1700 Einträge. Fehlt mir etwas?
Optimierer

1
Zunächst arbeite ich noch daran, aber ansonsten - es schien eine gute Idee zu sein, ich habe es versucht, es ist fehlgeschlagen. Wenn überhaupt, wird dies die Menschen davon abhalten, Zeit mit demselben Ansatz zu verschwenden
DenDenDo

Heh :) Behaltet die positive Einstellung bei :) Ich hoffe, dass dies zu besseren Ergebnissen führt.
Optimierer

2
" Diese Wörter können nur am Anfang oder am Ende der Kette stehen " ist falsch. Die größte zusammenhängende Komponente im Diagramm enthält Wörter wie Boutonnières , die einen akzentuierten Charakter haben, jedoch nicht im Präfix oder Suffix. Es betrifft nur etwa ein Dutzend Wörter, aber eines davon könnte eine Schlüsselverbindung sein.
Peter Taylor
Durch die Nutzung unserer Website bestätigen Sie, dass Sie unsere Cookie-Richtlinie und Datenschutzrichtlinie gelesen und verstanden haben.
Licensed under cc by-sa 3.0 with attribution required.