PHPCLANCHILDES with regular expressions

8 matches in 8 utterances

3.15 per 1,000 words of the child (CHI), in 1 of 1 transcripts (638 utterances, 2,537 words searched).

  1. how does it go ? CHI · eng_USA_Brown/adam32.cha, line 328 · Adam 3;06
  2. does the light come on there ? CHI · eng_USA_Brown/adam32.cha, line 335 · Adam 3;06
  3. does this walk ? CHI · eng_USA_Brown/adam32.cha, line 471 · Adam 3;06
  4. where does it go ? CHI · eng_USA_Brown/adam32.cha, line 1219 · Adam 3;06
  5. where does dis go anyplace ? CHI · eng_USA_Brown/adam32.cha, line 1328 · Adam 3;06
  6. does zis go here ? CHI · eng_USA_Brown/adam32.cha, line 1544 · Adam 3;06
  7. does Paul have to touch ? CHI · eng_USA_Brown/adam32.cha, line 1918 · Adam 3;06
  8. and Mommy doos [: does] two . CHI · eng_USA_Brown/adam32.cha, line 2121 · Adam 3;06
  1. CHIhow # work ?
    URSone has to go this way and one this way .
    CHI*CHI: how does it go ?
    CHIwhat chu call that ?
    URSit's a telegraph key # but it doesn't seem to work .
  2. CHIwhat chu call that ?
    URSit's a telegraph key # but it doesn't seem to work .
    CHI*CHI: does the light come on there ?
    URSI don't see it .
    URSdo you ?
  3. MOTthey walk # don't they ?
    MOTand fly .
    CHI*CHI: does this walk ?
    CHIhe trying to do de walk .
    CHIdis carry blocks .
  4. URSwhat is it ?
    RICb@l .
    CHI*CHI: where does it go ?
    CHII don't see the line .
    CHIyou tell me .
  5. MOToh # good .
    CHIwhere it goes ?
    CHI*CHI: where does dis go anyplace ?
    CHII can't .
    MOTwhat are you looking for ?
  6. CHIhuh ?
    CHIhey # you .
    CHI*CHI: does zis go here ?
    MOTno # I don't think so # does it ?
    CHIupsidedown # goes there .
  7. MOTyou don't have to make it .
    MOTI mean with these .
    CHI*CHI: does Paul have to touch ?
    MOTmhm .
    CHIand what he want to do with them ?
  8. MOTdo what ?
    RICI do h@l .
    CHI*CHI: and Mommy doos [: does] two .
    CHII will have turn # and you have x@l .
    CHIwe have two and I have eight .

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. Adam eng_USA_Brown3.15
All transcripts as a table
TranscriptChildAgeWordsUtterances matchedMatchesPer 1,000 words
eng_USA_Brown/adam32.chaAdam 3;6.092,537883.15

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. does8 · 100.0%