PHPCLANCHILDES with regular expressions

6 matches in 6 utterances

2.66 per 1,000 words of everyone but CHI, in 1 of 1 transcripts (439 utterances, 2,252 words searched).

  1. yes # I could bring them next time . MOT · eng_USA_Brown/adam39.cha, line 352 · Adam 3;10
  2. maybe you could tie it on . URS · eng_USA_Brown/adam39.cha, line 732 · Adam 3;10
  3. oh # how could they all win ? URS · eng_USA_Brown/adam39.cha, line 1379 · Adam 3;10
  4. how could an airplane go through a tunnel ? MOT · eng_USA_Brown/adam39.cha, line 1519 · Adam 3;10
  5. how could it ? MOT · eng_USA_Brown/adam39.cha, line 1525 · Adam 3;10
  6. I don't think it could go under it easily or through it . MOT · eng_USA_Brown/adam39.cha, line 1536 · Adam 3;10
  1. eng_USA_Brown/adam39.cha, line 352 · Adam, 3;10.15
    MOTmaybe if she wants to .
    CHIcould you being some arrows ?
    MOT*MOT: yes # I could bring them next time .
    CHII can [?] wheelbarrow today .
    MOTyou what ?
  2. eng_USA_Brown/adam39.cha, line 732 · Adam, 3;10.15
    URSyou know what you might do # Adam ?
    CHIwhat ?
    URS*URS: maybe you could tie it on .
    URSd(o) you want to tie it ?
    CHIyeah .
  3. eng_USA_Brown/adam39.cha, line 1379 · Adam, 3;10.15
    URSwho won ?
    CHIall of de cars win .
    URS*URS: oh # how could they all win ?
    CHIone turned around .
    URSoh .
  4. eng_USA_Brown/adam39.cha, line 1519 · Adam, 3;10.15
    CHIairplane .
    CHIhere's a tunnel go through .
    MOT*MOT: how could an airplane go through a tunnel ?
    CHIairplane could .
    MOThow could it ?
  5. eng_USA_Brown/adam39.cha, line 1525 · Adam, 3;10.15
    MOThow could an airplane go through a tunnel ?
    CHIairplane could .
    MOT*MOT: how could it ?
    CHIlike dis .
    CHIit's could go in de tunnel like dat .
  6. eng_USA_Brown/adam39.cha, line 1536 · Adam, 3;10.15
    CHIcould it # huh ?
    CHIcould it go in the tunnel ?
    MOT*MOT: I don't think it could go under it easily or through it .
    MOTwhat should we say # Adam ?
    MOTdo we go under a tunnel or do we go through a tunnel ?

Matches by age

One dot per transcript: matches per 1,000 words of everyone but 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_Brown2.66
All transcripts as a table
TranscriptChildAgeWordsUtterances matchedMatchesPer 1,000 words
eng_USA_Brown/adam39.chaAdam 3;10.152,252662.66

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