BijectiveFunctionIndexationin a treeDescribeLemmatizationDefineDomainDepth-firstsearchCreate aregularexpressionfor cat & catsEquivalenceof NFA andDFASurjectiveFunctionDefineNFAWeakEquivalenceInjectiveFunctionConcatenationin RegexTerminalsin a treeBreadth-firstsearchRelationsvs.FunctionsDifferencebetweensetsStringDistanceKleeneStar inRegexUnioninRegexNon-terminalsin a treeCardinalityDefinecodomainDefineDFALevenshteinDistanceBijectiveFunctionIndexationin a treeDescribeLemmatizationDefineDomainDepth-firstsearchCreate aregularexpressionfor cat & catsEquivalenceof NFA andDFASurjectiveFunctionDefineNFAWeakEquivalenceInjectiveFunctionConcatenationin RegexTerminalsin a treeBreadth-firstsearchRelationsvs.FunctionsDifferencebetweensetsStringDistanceKleeneStar inRegexUnioninRegexNon-terminalsin a treeCardinalityDefinecodomainDefineDFALevenshteinDistance

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