StringDistanceUnioninRegexConcatenationin RegexBreadth-firstsearchBijectiveFunctionEquivalenceof NFA andDFADefineDomainKleeneStar inRegexTerminalsin a treeCreate aregularexpressionfor cat & catsIndexationin a treeDefineNFAWeakEquivalenceDefinecodomainDepth-firstsearchDescribeLemmatizationInjectiveFunctionSurjectiveFunctionDefineDFACardinalityDifferencebetweensetsNon-terminalsin a treeLevenshteinDistanceRelationsvs.FunctionsStringDistanceUnioninRegexConcatenationin RegexBreadth-firstsearchBijectiveFunctionEquivalenceof NFA andDFADefineDomainKleeneStar inRegexTerminalsin a treeCreate aregularexpressionfor cat & catsIndexationin a treeDefineNFAWeakEquivalenceDefinecodomainDepth-firstsearchDescribeLemmatizationInjectiveFunctionSurjectiveFunctionDefineDFACardinalityDifferencebetweensetsNon-terminalsin a treeLevenshteinDistanceRelationsvs.Functions

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