DefinecodomainDepth-firstsearchSurjectiveFunctionDefineDFADefineNFALevenshteinDistanceUnioninRegexEquivalenceof NFA andDFAIndexationin a treeTerminalsin a treeCardinalityNon-terminalsin a treeDefineDomainStringDistanceWeakEquivalenceRelationsvs.FunctionsDescribeLemmatizationKleeneStar inRegexBreadth-firstsearchBijectiveFunctionInjectiveFunctionCreate aregularexpressionfor cat & catsDifferencebetweensetsConcatenationin RegexDefinecodomainDepth-firstsearchSurjectiveFunctionDefineDFADefineNFALevenshteinDistanceUnioninRegexEquivalenceof NFA andDFAIndexationin a treeTerminalsin a treeCardinalityNon-terminalsin a treeDefineDomainStringDistanceWeakEquivalenceRelationsvs.FunctionsDescribeLemmatizationKleeneStar inRegexBreadth-firstsearchBijectiveFunctionInjectiveFunctionCreate aregularexpressionfor cat & catsDifferencebetweensetsConcatenationin Regex

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