PHPCLANCHILDES with regular expressions

5 matches in 5 utterances

6.91 per 1,000 words of the child (CHI), in 1 of 1 transcripts (313 utterances, 724 words searched).

  1. Toby and Percy driver . CHI · eng_british_Manchester_I/carl15b.cha, line 772 · Carl 2;01
  2. Percy 0is [*] smiling . CHI · eng_british_Manchester_I/carl15b.cha, line 788 · Carl 2;01
  3. Percy another Thomas . CHI · eng_british_Manchester_I/carl15b.cha, line 1074 · Carl 2;01
  4. I not broken my Percy . CHI · eng_british_Manchester_I/carl15b.cha, line 1138 · Carl 2;01
  5. not [/] I not [*] want a broken Percy . CHI · eng_british_Manchester_I/carl15b.cha, line 1140 · Carl 2;01
  1. MOTthat's right .
    MOTThomas has got the Fat_Controller .
    CHI*CHI: Toby and Percy driver .
    CHIand Fat_Controller .
    MOTmmhm .
  2. MOToh that's good .
    MOThe's smiling , isn't he ?
    CHI*CHI: Percy 0is [*] smiling .
    MOTPercy's smiling , is he ?
    CHIToby's happy .
  3. MOToh yes .
    MOTanother Thomas .
    CHI*CHI: Percy another Thomas .
    CHIanother Thomas .
    CHIow .
  4. MOTwell be careful .
    MOTyou will break it .
    CHI*CHI: I not broken my Percy .
    CHInot [/] I not [*] want a broken Percy .
    MOTyou don't want a broken Percy .
  5. MOTyou will break it .
    CHII not broken my Percy .
    CHI*CHI: not [/] I not [*] want a broken Percy .
    MOTyou don't want a broken Percy .
    MOTyou'd better fix him then .

Matches by age

One dot per transcript: matches per 1,000 words of the child (CHI). Dots of the same child are joined.

Matches by child

Matches per 1,000 words, all transcripts of each child together, highest first.

  1. Carl eng_british_Manchester_I6.91
All transcripts as a table
TranscriptChildAgeWordsUtterances matchedMatchesPer 1,000 words
eng_british_Manchester_I/carl15b.chaCarl 2;1.16724556.91

What the pattern matched

1 different forms (lowercased). Useful to see what a pattern really catches: unexpected forms here usually mean the pattern is too broad.

  1. percy5 · 100.0%