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