N-GRAM INPUT

Home xx > Multiwords > N-Gram Extractor input

N-Gram Extractor
Identify repeated strings of words or families throughout a text, with or without intervening items

RESEARCH:
1. Review, this routine 2. Review Alison Wray 3. Review Nadia Nesselhauf 4. Cobb (2004, L. Corpus) 5. Erman & Warren (2000) 6. Cobb (2018)

INPUT METHOD "A"
SMALL/MEDIUM TEXTS BUT RICHER OUTPUT (concordance lines); max 400,000 chars/60,000 words

1 Enter the title of your text. 2 Copy or type the text in the space below.
Enter your text here. This program will pull out all its recurring word strings up to the maximum length of five words (step 3 below). For a demonstration, just click SUBMIT to enter this text (and when you "enter this text" you will see at least one recurring three-word string). Clearly not every repeated word string is a meaningful unit, and not every meaningful multi-word unit is a lexicalised unit as described in the research (links this page). Therefore, this program allows inspection of each extracted string in concordance format so that its status can be determined. TEXT SET-UP Eventually, this program will accept ANY text input regardless of formatting irregularity. In the meantime, please report any errors to Tom, with the offending text attached where possible (email on home page). General: Include an empty space after every comma or full stop, but not before. Correct any spelling errors as these may hide recurrences.
| Demo 1 (written) | Demo 2 (spoken) | NEW*Demo 3 (Intervening Items + Families)
3 Choose max string: 2 |3 |4 |5 wds 4 Interveners (2+3 wd) 5 Families [Inters+fams?] 6

INPUT METHOD "B"
TEXT FILE UPOAD - LARGER TEXTS - MORE COMPLETE OUTPUT (But no Intervenors in Upload Mode temporarily)

1. 2. Families? Interveners? 3. Max string 4.

OR small corpus (to approx. 350,000 wds @ max=6)
>> Families? +Max