Commit graph

13 commits

Author SHA1 Message Date
Andreas Koepf
3e7ff3b084 use native types List->list, Dict->dict, Set->set, Tuple->tuple 2025-02-21 15:15:38 +01:00
abdulhakeem
15140d06e7 Tweaked some question templates 2025-02-17 02:58:42 -06:00
Andreas Koepf
44f8d7b6af formatting 2025-02-16 16:18:39 +01:00
Ubuntu
316cf0dac7 reformatted word ladder question template 2025-02-16 09:04:17 +00:00
Adefioye
bea9e6d96a
Add score_answer method to word_ladder (#93)
* Add score_answer method to word_ladder
* add unit test for WordLadderDataset::score_answer()

---------

Co-authored-by: Andreas Koepf <andreas.koepf@provisio.com>
2025-02-10 15:15:23 +01:00
Cavit Erginsoy
aff0fecef4 lint 2025-02-03 11:35:30 +00:00
Cavit Erginsoy
9b1068ea39 Merge remote-tracking branch 'upstream/main' 2025-02-03 07:44:32 +00:00
Cavit Erginsoy
d5065955a8 Refactor word ladder generation with improved validation and graph-based path finding
- Enhanced configuration validation with size and length constraints
- Implemented graph-based neighbor computation and caching
- Simplified path finding algorithm with more robust length checking
- Added more flexible word set loading with configurable length ranges
- Improved error handling for dataset generation
2025-02-03 07:21:43 +00:00
Cavit Erginsoy
da11def5c7 Improve efficiency and reduce plural bias in word ladder generation
- Precomputed sorted word lists for each word length (stored in self.words_lists) to avoid redundant sorting on every _generate_word_pair call.
- Updated _generate_word_pair to utilize the cached sorted list, significantly improving computational efficiency.
- Implemented weighted random sampling for 5-letter words, giving words ending with 'S' a lower weight (0.5) to reduce bias without completely filtering them out.
2025-02-01 14:37:21 +00:00
Cavit Erginsoy
7e29fc12e1 refactor: Clarify word ladder question 2025-02-01 14:27:06 +00:00
Andreas Koepf
5ae329becd lint 2025-01-30 23:14:32 +01:00
Cavit Erginsoy
df3c4580ee INIT 2025-01-30 21:32:46 +00:00
Cavit Erginsoy
d58dfd0bd4 INIT 2025-01-30 19:42:58 +00:00