Create aregularexpressionfor cat & catsWeakEquivalenceRelationsvs.FunctionsKleeneStar inRegexDescribeLemmatizationStringDistanceDefineDFADepth-firstsearchConcatenationin RegexNon-terminalsin a treeSurjectiveFunctionDifferencebetweensetsDefineDomainIndexationin a treeCardinalityDefineNFAUnioninRegexBijectiveFunctionLevenshteinDistanceBreadth-firstsearchEquivalenceof NFA andDFAInjectiveFunctionDefinecodomainTerminalsin a treeCreate aregularexpressionfor cat & catsWeakEquivalenceRelationsvs.FunctionsKleeneStar inRegexDescribeLemmatizationStringDistanceDefineDFADepth-firstsearchConcatenationin RegexNon-terminalsin a treeSurjectiveFunctionDifferencebetweensetsDefineDomainIndexationin a treeCardinalityDefineNFAUnioninRegexBijectiveFunctionLevenshteinDistanceBreadth-firstsearchEquivalenceof NFA andDFAInjectiveFunctionDefinecodomainTerminalsin a tree

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