Grad A: Yeah . It doesn't matter what those nodes are , anyway , because we 'll just make the weights " zero " for now .
Grad B: Yep . We 'll make them zero for now , because it who who knows what they come up with , what 's gonna come in there . OK . And , um , then should we start on Thursday ?
Grad A: OK .
Grad B: And not meet tomorrow ?
Grad A: Sure .
Grad B: OK . I 'll send an email , make a time suggestion .
Grad C: Wait , maybe it 's OK , so that that that we can that we have one node per construction . Cuz even in people , like , they don't know what you 're talking about if you 're using some sort of strange construction .
Grad B: Yeah , they would still c sort of get the closest , best fit .
Grad C: Well , yeah , but I mean , the uh , I mean , that 's what the construction parser would do .
Grad B: Mm - hmm .
Grad C: Uh , I mean , if you said something completely arbitrary , it would f find the closest construction ,
Grad B: OK .
Grad C: right ? But if you said something that was completel er h theoretically the construction parser would do that But if you said something for which there was no construction whatsoever , n people wouldn't have any idea what you were talking about .
Grad B: Mm - hmm .
Grad C: Like " Bus dog fried egg . " I mean . You know .
Grad B: Or , if even something Chinese , for example .
Grad C: Or , something in Mandarin , yeah . Or Cantonese , as the case may be . What do you think about that , Bhaskara ?
Grad A: I mean Well But how many constructions do could we possibly have nodes for ?
Grad C: In this system , or in r
Grad A: No , we . Like , when people do this kind of thing .
Grad C: Oh , when p How many constructions do people have ?
Grad A: Yeah .
Grad C: I have not {comment} the slightest idea .
Grad A: Is it considered to be like in are they considered to be like very , uh , sort of s abstract things ?
Grad C: Every noun is a construction .
Grad A: OK , so it 's like in the thousands .
Grad C: The Yeah . Any any form - meaning pair , to my understanding , is a construction .
Grad A: OK .
Grad B: So .
Grad C: And form u starts at the level of noun Or actually , maybe even sounds .
Grad B: Phoneme . Yep .
Grad C: Yeah . And goes upwards until you get the ditransitive construction .
Grad A: S
Grad C: And then , of course , the c I guess , maybe there can be the Can there be combinations of the dit
Grad A: Discourse - level constructions .
Grad C: Yeah . The " giving a speech " construction ,
Grad B: Rhetorical constructions .
Grad A: Yes .
Grad B: Yeah . But , I mean , you know , you can probably count count the ways . I mean .
Grad C: It 's probab Yeah , I would s definitely say it 's finite .
Grad B: Yeah .
Grad C: And at least in compilers , that 's all that really matters , as long as your analysis is finite .
Grad A: How 's that ? {nonvocalsound} How it can be finite , again ?
Grad C: Nah , I can't think of a way it would be infinite .
Grad B: Well , you can come up with new constructions .
Grad C: Yeah . {comment} If the if your if your brain was totally non - deterministic , then perhaps there 's a way to get , uh , infin an infinite number of constructions that you 'd have to worry about .
Grad A: But , I mean , in the {nonvocalsound} practical sense , it 's impossible .
Grad C: Right . Cuz if we have a fixed number of neurons ?
Grad A: Yeah .
Grad C: So the best - case scenario would be the number of constructions or , the worst - case scenario is the number of constructions equals the number of neurons .
Grad A: Well , two to the power of the number of neurons .
Grad C: Right . But still finite .
Grad B: OK .
Grad C: No , wait . Not necessarily , is it ? We can end the meeting . I just Can't you use different var different levels of activation ? across , uh lots of different neurons , to specify different values ?
Grad B: Mm - hmm .
Grad A: Um , yeah , but there 's , like , a certain level of Grad C: There 's a bandwidth issue ,
Grad A: Bandw - Yeah , so you can't do better than something .
Grad C: right ? Yeah .
Grad B: Turn off the mikes . Otherwise it gets really tough for the tr