THAT PROBABLY DOESN'T MAKE ANY SENSE AT ALL WHEREAS IF YOU JUST UH SHOW IMPORTANT UTTERANCES BUT THE UTTERANCE AS A WHOLE IT MAKES MORE SENSE SO IT DOESN'T ACTUALLY MAKE A DIFFERENCE FOR YOUR ALGORITHM 'CAUSE IT JUST MEANS THAT IF YOU'RE WORKING ON A WORD LEVEL THEN WE JUST MEAN IT OVER THE UTTERANCE THEY ARE ON OH SO THAT'S GOOD ANYWAY THEN YEAH BECAUSE THAT MAKES IT A LOT EASIER THAN TO T PUT IT ON UTTERANCE LEVEL OH YEAH NO BUT I MEAN LIKE HOW HOW JASMINE DOES IT INTERNALLY I DON'T KNOW BUT IT'S PROBABLY YEAH YOU PROBABLY HAVE TO WORK ON WORD LEVELS FOR IMPORTANCE BUT THERE SHOULD BE WAYS OF EASILY GOING FROM A WORD LEVEL TO AN UTTERANCE LEVEL OKAY YEAH PROB I THINK WE SHOULD FILTER THEM HMM AND THERE ARE QUITE UNIMPORTANT WORDS IN THERE BUT QUITE IMPORTANT WORDS AS WELL I THINK WE SHOULD JUST DISREGARD THE THE MAYBE WE SHOULD HAVE LIKE UM A CUT OFF SO IT A W WORD ONLY GETS A VALUE IF IT'S ABOVE A CERTAIN THRESHOLD SO ANYTHING THAT HAS LESS THAN SAY NOUGHT POINT FIVE IMPORTANCE GETS ASSIGNED TO ZERO ALRIGHT YEAH THAT'S THE OTHER TH BUT THAT WOULD MEAN IT WOULD STILL PLAY THE UH IN YOUR AUDIO UNLESS WE SORT OF ALSO STORE WHAT PIECES WE CUT OUT FOR THE AUDIO YEAH I THINK BEFORE WE CAN LIKE ANSWER THAT SPECIFIC QUESTION HOW WE C DEAL WITH THAT IT'S PROBABLY GOOD FOR US TO LOOK AT WHAT THE AUDIO PLAYER IS CAPABLE OF DOING I THINK WE'LL HAVE TO BUFFER THE AUDIO BUT I DON'T THINK IT WILL BE VERY HARD I THINK IT WOULD BE LIKE AN HOUR OR TWO'S WORK SO WHAT DO YOU MEAN BY BUFFERING LIKE YOU THINK DIRECTLY FEEDING YEAH YOU JUST CONCATENATE THEM TOGETHER IN MEMORY YEAH SO JUST LIKE UNP THERE'S BOUND TO BE LIKE A MEDIA WAVE OBJECT OR SOMETHING LIKE THAT AND JUST BUILD ONE IN MEMORY I DON'T KNOW I HAVE NO IDEA BUT IT MUST HAVE LIKE CLASSES FOR DEALING WITH FILES AND IF IT HAS CLASSES FOR CONCATENATING FILES YOU CAN DO IT IN MEMORY SO THERE'S STILL SOME MERIT ON WITHIN UTTERANCES CUTTING OUT STUFF WHICH CLEARLY ISN'T RELEVANT AT ALL AND THAT MAYBE ALSO FOR THE AUDIO WE'D HAVE TO DO SO LET'S SAY WE PLAY THE WHOLE AU PHRASE BUT THEN IN ADDITION TO THAT WE HAVE SOME INFORMATION THAT SAYS MINUS THAT PART OF SOMETHING THAT'S OKAY THAT WE CAN DO WELL WHAT I THINK I MIGHT TRY AND BUILD IS BASICALLY A CLASS THAT YOU JUST FEED IT A LINKED LIST OF UM DIFFERENT WAVE FORMS AND IT WILL JUST STRING THEM ALL TOGETHER WITH MAYBE I DON'T KNOW TENTH OF A SECOND SILENCE IN BETWEEN EACH ONE OR SOMETHING LIKE THAT IF MAYBE IF WE REALISE THAT THERE'S MASSIVE DIFFERENCES IN IN GAIN OR IN SOMETHING YOU CAN PROBABLY JUST MAKE SOME SIMPLE SIMPLE NORMALIZATION BUT THAT REALLY DEPENDS ON HOW MUCH TIME WE HAVE AND AND HOW MUCH IS NECESSARY YEAH IF LIKE I D I DON'T KNOW ANYTHING ABOUT AUDIO AND I HAVE NEVER SEEN THE PLAYER SO IF YOU FIND THAT THE PLAYER ACCEPTS SOME N INPUT FROM MEMORY AND IF IT'S EASY TO DO THEN I GUESS THAT'S THAT'S FAIRLY DOABLE SO BUT THAT MEANS IN THE GENERAL STRUCTURE WE'RE ACTUALLY QUITE LUCKY SO WE WE HAVE WE LOAD INTO MEMORY FOR THE WHOLE SERIES OF MEETINGS JUST THE UTTERANCES AND RANKINGS FOR THE UTTERANCES AND SOME INFORMATION PROBABLY THAT SAYS WELL THE I GUESS THAT GOES WITH THE UTTERANCE WHO'S SPEAKING OH YEAH YEAH WE'LL NEED THAT WE ALSO REALLY WANNA BE ABLE TO SEARCH BY WHO'S SPEAKING AS WELL YEAH BUT I'M I'M STILL CONFUSED 'CAUSE I THOUGHT LIKE THAT'S JUST WHAT JONATHAN SAID WE DO C THAT WE CAN'T DO LIKE LOAD A MASSIVE DOCUMENT OF THAT SIZE ON THE OTHER HAND THE OTHER HAND I MEAN IT SHOULDN'T BE LIKE SHOULD BE LIKE FIFTY MEGA BYTE IN RAM OR SOMETHING IT SHOULDN'T BE MASSIVE SHOULD IT ACTUALLY FIFTY HUNDRED MEGABYTE IS QUITE BIG IN RAM JUST THINKING WHAT'S THE SIMP SO WE DO GET AN ERROR MESSAGE WITH THE PROJECT IF WE LOAD EVERYTHING INTO THE PROJECT WITH ALL THE DATA THEY LOAD SO WE KNOW THAT DOESN'T WORK SO OUR HOPE IS ESSENTIALLY THAT WE LOAD LESS INTO IT WHAT'S THIS LAZY LOADING THING SOMEBODY EXPLAIN LAZY LOADING TO ME IT ONLY LOADS WHEN IT NEEDS A PARTICULAR TYPE OF FILE LIKE WHEN IT'S BEING ACCESSED SO THAT IS THAT ONLY BY TYPE OF FILE LIKE IF IF IF THE SAME THING IS IN DIFFERENT FILES WOULD IT THEN MAYBE LIKE YOU KNOW IF IF UTTERANCES ARE SPLIT OVER THREE OR TEN OR W HUNDRED DIFFERENT FILES IS THEN A CHANCE MAYBE THAT IT DOESN'T TRY TO LOAD THEM ALL INTO MEMORY AT THE SAME TIME BUT JUST YEAH I THINK THAT'S THE IDEA IT JUST LOADS THE PARTICULAR ONES IT NEEDS THEN IT SHOULDN'T EVER FAIL BECAUSE THEN IT SHOULD NEVER BUT IF YOU WERE DOING A SEARCH OVER THE WHOLE CORPUS YOU'D HAVE TO LOAD THEM ALL YES RIGHT HMM OOPS IT DOES SO I DEFINE BASELINE AND WHAT IT LOADS FOR EXAMPLE IT LOADS ALL THE UTTERANCES AND SO ON BUT IT DOESN'T LOAD UM THE DISCOURSE ACTS AND FOR EXAMPLE NOT THE AND WHAT'S WHAT ELSE THERE NOT THE SUMMARIES IT ONLY LOADS THOSE ON DEMAND LET'S CHECK THAT OUT UM I'LL P I'LL PROBABLY ASK JONATHAN ABOUT IT SO ALTERNATIVELY IF WE REALISE WE CAN'T DO THE WHOLE THING IN ONE GO WE CAN PROBABLY JUST PROCESS SOME SORT OF META DATA YOU KNOW WHAT I MEAN LIKE SORT OF SORT OF FOR THE WHOLE SERIES CHUNKS REPRESENTING THE INDIVIDUAL MEETINGS OR SOME LIKE SOMETHING THAT REPRESENTS THE WHOLE SERIES IN IN A V IN A STRUCTURE VERY SIMILAR TO THE STRUCTURE IN WHICH WE REPRESENT INDIVIDUAL UM MEETINGS BUT WITH DATA SORT OF ALWAYS COMBINED FROM THE WHOLE SERIES SO INSTEAD OF HAVING AN SINGLE UTTERANCE THAT WE DISPLAY IT WOULD PROBABLY BE LIKE THAT WOULD BE REPRESENTING A WHOLE UM TOPIC A SEGMENT IN A MEETING AND SORT OF SO THAT WI USING THE SAME DATA ST FOR EXAMPLE THAT YOU HAVE A VERY UM TOP LEVEL UM SUMMARY AND A SEPARATE FILE FOR FOR EACH LEVEL THAT'S EASY YOU JUST LIKE CREATE A NEW X. M. L. DOCUMENT IN MEMORY AND TREATS THE INDIVIDUAL MEETINGS WITHIN THE SERIES AS IF THEY WERE SEGMENTS AND TREATS THE INDIVIDUAL SEGMENTS WITHIN MEETINGS AS IF THEY WERE UM UTTERANCES YOU KNOW SO WE JUST SORT OF WE SHIFT IT ONE LEVEL UP AND IN THAT WAY WE COULD PROBABLY USE THE SAME ALGORITHM AND JUST LIKE MAKE VIR LIKE ONE OR TWO IFS THAT SAY OKAY IF YOU ARE ON A WHOLE DOCUMENT UH A WHOLE SERIES LEVEL AND THAT WAS A DOUBLE CLICK THEN DON'T JUST GO INTO THAT UM SEGMENT BUT LOAD A NEW FILE OR SOMETHING LIKE IT BUT IN GENERAL USE THE SAME ALGORITHM