regexp_learner package¶
Subpackages¶
- regexp_learner.gold package
- Submodules
- regexp_learner.gold.gold module
- regexp_learner.gold.observation_table module
GoldObservationTable
GoldObservationTable.ONE
GoldObservationTable.STAR
GoldObservationTable.ZERO
GoldObservationTable.are_obviously_different()
GoldObservationTable.check_input_consistency()
GoldObservationTable.choose_compatible_red_state()
GoldObservationTable.choose_obviously_different_blue_state()
GoldObservationTable.get_value_from_sample()
GoldObservationTable.is_consistent_with_samples()
GoldObservationTable.make_pta()
GoldObservationTable.to_automaton()
GoldObservationTable.to_html()
GoldObservationTable.try_and_fill_holes()
GoldObservationTable.try_and_promote_blue()
- Module contents
- regexp_learner.lstar package
- Submodules
- regexp_learner.lstar.automaton_match module
- regexp_learner.lstar.learner module
- regexp_learner.lstar.observation_table module
LstarObservationTable
LstarObservationTable.add_col()
LstarObservationTable.add_prefix()
LstarObservationTable.add_row()
LstarObservationTable.add_suffix()
LstarObservationTable.e
LstarObservationTable.find_mismatch_closeness()
LstarObservationTable.find_mismatch_consistency()
LstarObservationTable.get()
LstarObservationTable.get_col()
LstarObservationTable.get_or_create_index()
LstarObservationTable.get_row()
LstarObservationTable.is_closed()
LstarObservationTable.is_consistent()
LstarObservationTable.row()
LstarObservationTable.set()
LstarObservationTable.to_html()
- regexp_learner.lstar.teacher module
- Module contents
Submodules¶
regexp_learner.strings module¶
- is_prefix_closed(strings: set) bool [source]¶
Tests whether a set of strings is prefix-closed (i.e., all the prefixes of all the strings belong to this set).
Example
>>> from regexp_learner import is_prefix_closed >>> is_prefix_closed({"", "a", "ab", "abc"}) True >>> is_prefix_closed({"xy", "xyz"}) False
- Parameters:
strings (set) – A set of strings.
- Returns:
True
iffstrings
is prefix-closed,False
otherwise.
- is_suffix_closed(str_set) bool [source]¶
Tests whether a set of strings is suffix-closed (i.e., all the suffixes of all the strings belong to this set).
Example
>>> from regexp_learner import is_suffix_closed >>> is_suffix_closed({"", "abc", "bc", "c"}) True >>> is_suffix_closed({"xy", "xyz"}) False
- Parameters:
strings (set) – A set of strings.
- Returns:
True
iffstrings
is suffix-closed,False
otherwise.
Module contents¶
Top-level package.