Indexationin a treeBijectiveFunctionDefineNFAWeakEquivalenceUnioninRegexCardinalityLevenshteinDistanceKleeneStar inRegexSurjectiveFunctionDepth-firstsearchTerminalsin a treeDescribeLemmatizationDefineDomainBreadth-firstsearchStringDistanceCreate aregularexpressionfor cat & catsEquivalenceof NFA andDFANon-terminalsin a treeRelationsvs.FunctionsInjectiveFunctionDifferencebetweensetsDefineDFAConcatenationin RegexDefinecodomainIndexationin a treeBijectiveFunctionDefineNFAWeakEquivalenceUnioninRegexCardinalityLevenshteinDistanceKleeneStar inRegexSurjectiveFunctionDepth-firstsearchTerminalsin a treeDescribeLemmatizationDefineDomainBreadth-firstsearchStringDistanceCreate aregularexpressionfor cat & catsEquivalenceof NFA andDFANon-terminalsin a treeRelationsvs.FunctionsInjectiveFunctionDifferencebetweensetsDefineDFAConcatenationin RegexDefinecodomain

Computational Linguistics Bingo - Call List

(Print) Use this randomly generated list as your call list when playing the game. There is no need to say the BINGO column name. Place some kind of mark (like an X, a checkmark, a dot, tally mark, etc) on each cell as you announce it, to keep track. You can also cut out each item, place them in a bag and pull words from the bag.


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
  1. Indexation in a tree
  2. Bijective Function
  3. Define NFA
  4. Weak Equivalence
  5. Union in Regex
  6. Cardinality
  7. Levenshtein Distance
  8. Kleene Star in Regex
  9. Surjective Function
  10. Depth-first search
  11. Terminals in a tree
  12. Describe Lemmatization
  13. Define Domain
  14. Breadth-first search
  15. String Distance
  16. Create a regular expression for cat & cats
  17. Equivalence of NFA and DFA
  18. Non-terminals in a tree
  19. Relations vs. Functions
  20. Injective Function
  21. Difference between sets
  22. Define DFA
  23. Concatenation in Regex
  24. Define codomain