Relationsvs.FunctionsCardinalityWeakEquivalenceBreadth-firstsearchKleeneStar inRegexBijectiveFunctionDefineDFADefineDomainNon-terminalsin a treeInjectiveFunctionDifferencebetweensetsDescribeLemmatizationDepth-firstsearchIndexationin a treeStringDistanceCreate aregularexpressionfor cat & catsSurjectiveFunctionEquivalenceof NFA andDFATerminalsin a treeDefinecodomainConcatenationin RegexLevenshteinDistanceUnioninRegexDefineNFARelationsvs.FunctionsCardinalityWeakEquivalenceBreadth-firstsearchKleeneStar inRegexBijectiveFunctionDefineDFADefineDomainNon-terminalsin a treeInjectiveFunctionDifferencebetweensetsDescribeLemmatizationDepth-firstsearchIndexationin a treeStringDistanceCreate aregularexpressionfor cat & catsSurjectiveFunctionEquivalenceof NFA andDFATerminalsin a treeDefinecodomainConcatenationin RegexLevenshteinDistanceUnioninRegexDefineNFA

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